Scalable approximate optimal diagonal preconditioning

DOI10.1007/S10589-026-00770-8MaRDI QIDQ7262393zbMATH OpenFDO

Authors Wenzhi Gao, Zhaonan Qu, Madeleine Udell, Yinyu Ye

Publication date 11 June 2026

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10589-026-00770-8

zbMATH Keywords

dimension reductionpreconditioningsemi-definite programming

Mathematics Subject Classification ID

Numerical analysis (65-XX) Mathematical programming (90Cxx) Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 1953444 (Why is no real title available?)
• A Spectral Bundle Method for Semidefinite Programming
• A Symmetry Preserving Algorithm for Matrix Scaling
• A comparative study of sparse approximate inverse preconditioners
• A fast algorithm for matrix balancing
• A matrix generation approach for eigenvalue optimization
• A modified SSOR preconditioner for sparse symmetric indefinite linear systems of equations
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A robust incomplete factorization preconditioner for positive definite matrices
• Adaptive Lanczos methods for recursive condition estimation
• Algorithm 1055: HDSDP: software for semidefinite programming
• An Algorithm for Optimal ℓ₂ Scaling of Matrices
• An Estimate for the Condition Number of a Matrix
• An interior point constraint generation algorithm for semi-infinite optimization with health-care application
• An optimal-storage approach to semidefinite programming using approximate complementarity
• Condition numbers and equilibration of matrices
• Conic optimization via operator splitting and homogeneous self-dual embedding
• Disciplined quasiconvex programming
• Large-Scale Optimization of Eigenvalues
• Methods of conjugate gradients for solving linear systems
• Minimizing Condition Number via Convex Programming
• Minimizing the Condition Number of a Gram Matrix
• Minimizing the Euclidean Condition Number
• On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues
• On the simplicity and conditioning of low rank semidefinite programs
• Optimal diagonal preconditioning
• Optimal preconditioners of a given sparsity pattern
• Optimally scaled matrices, necessary and sufficient conditions
• Optimizing condition numbers
• Random projections for conic programs
• Randomized Nyström Preconditioning
• Revisiting Spectral Bundle Methods: Primal-Dual (Sub)linear Convergence Rates
• Scalable semidefinite programming
• Selected Topics in Column Generation
• Uniform Error Estimates for the Lanczos Method

This page was built for publication: Scalable approximate optimal diagonal preconditioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7262393)