Minimizing Condition Number via Convex Programming
From MaRDI portal
Publication:3225534
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
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
- Metric selection in fast dual forward-backward splitting
- Optimization methods for frame conditioning and application to graph Laplacian scaling
- Constructing K-optimal designs for regression models
- Reconstruction of sparse-view tomography via preconditioned Radon sensing matrix
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)
