Optimal Diagonal Preconditioning

Zhaonan Qu (), Wenzhi Gao (), Oliver Hinder (), Yinyu Ye () and Zhengyuan Zhou ()
Additional contact information
Zhaonan Qu: Department of Economics, Stanford University, Stanford, California 94305; and Department of Management Science and Engineering, Stanford University, Stanford, California 94305
Wenzhi Gao: Institute for Computational and Mathematical Engineering (ICME), Stanford University, Stanford, California 94305
Oliver Hinder: Department of Industrial Engineering, University of Pittsburgh, Pittsburgh, Pennsylvania 15213
Yinyu Ye: Department of Management Science and Engineering, Stanford University, Stanford, California 94305
Zhengyuan Zhou: NYU Stern School of Business, New York University, New York, New York 10012

Operations Research, 2025, vol. 73, issue 3, 1479-1495

Abstract: Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techniques in practice, most lack guarantees on reductions in condition number, and the degree to which we can improve over existing heuristic preconditioners remains an important question. In this paper, we study the problem of optimal diagonal preconditioning that achieves maximal reduction in the condition number of any full-rank matrix by scaling its rows and/or columns with positive numbers. We first reformulate the problem as a quasiconvex optimization problem and provide a simple algorithm based on bisection. Then, we develop an interior point algorithm with O ( log ( 1 / ϵ ) ) iteration complexity, where each iteration consists of a Newton update based on the Nesterov-Todd direction. Next, we specialize in one-sided optimal diagonal preconditioning problems and demonstrate that they can be formulated as standard dual semidefinite program (SDP) problems. We then develop efficient customized solvers for the SDP approach and study the empirical performance of our optimal diagonal preconditioning procedures through extensive experiments. Our findings suggest that optimal diagonal preconditioners can significantly improve upon existing heuristics-based diagonal preconditioners at reducing condition numbers, and our SDP approach can find such optimal preconditioners efficiently. We also extend our SDP approach to compute optimal mixtures of heuristic preconditioners, which further improves its scalability and applicability.

Keywords: Optimization; diagonal preconditioning; condition number; iterative methods; interior point algorithms (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.2022.0592 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:73:y:2025:i:3:p:1479-1495

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().