Minimizing Condition Number via Convex Programming

DOI10.1137/100795097zbMath1235.90114OpenAlexW2051289974WikidataQ57511257 ScholiaQ57511257MaRDI QIDQ3225534

Ting Kei Pong, Zhaosong Lu

Publication date: 21 March 2012

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/49265acb68a79194f91b272624bf5e3358c25d15

zbMATH Keywords

semidefinite programmingcondition numberconvex programmingdiagonal preconditioner

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)

Related Items (5)

Constructing K-optimal designs for regression models ⋮ Metric selection in fast dual forward-backward splitting ⋮ Optimization Methods for Frame Conditioning and Application to Graph Laplacian Scaling ⋮ Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix ⋮ K-Optimal Design via Semidefinite Programming and Entropy Optimization

Uses Software

• SeDuMi
• SDPT3
• SDPLR

This page was built for publication: Minimizing Condition Number via Convex Programming