Minimizing Condition Number via Convex Programming
DOI10.1137/100795097zbMATH Open1235.90114OpenAlexW2051289974WikidataQ57511257 ScholiaQ57511257MaRDI QIDQ3225534FDOQ3225534
Authors: Zhaosong Lu, Ting Kei Pong 
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
Recommendations
- A condition number theorem in convex programming
- Condition numbers and error bounds in convex programming
- A coordinate-free condition number for convex programming
- Efficient algorithms for solving condition number-constrained matrix minimization problems
- Approximate optimality conditions for minimax programming problems
- Condition Number Theorems in Optimization
- scientific article; zbMATH DE number 4008109
- Condition number theorems in linear-quadratic optimization
- Computing minimum norm solution of a specific constrained convex nonlinear problem
- Convex programs for minimal-area problems
Convex programming (90C25) Semidefinite programming (90C22) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Cited In (8)
- Minimizing the Euclidean Condition Number
- Efficient algorithms for solving condition number-constrained matrix minimization problems
- \(K\)-optimal design via semidefinite programming and entropy optimization
- Optimizing condition numbers
- Optimization methods for frame conditioning and application to graph Laplacian scaling
- Metric selection in fast dual forward-backward splitting
- Constructing K-optimal designs for regression models
- Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix
Uses Software
This page was built for publication: Minimizing Condition Number via Convex Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3225534)
