For quadratic cone programs with strongly convex objectives, choosing the objective scaling factor as sqrt(sigma_min / 2) provably minimizes the KKT condition number, and packaging this with hypersphere and row-normalization steps yields a fast, factorization-free preconditioner.
Real-time sequential conic optimization for multi-phase rocket landing guidance,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
ACCEPT 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Optimal Preconditioning for Online Quadratic Cone Programming
For quadratic cone programs with strongly convex objectives, choosing the objective scaling factor as sqrt(sigma_min / 2) provably minimizes the KKT condition number, and packaging this with hypersphere and row-normalization steps yields a fast, factorization-free preconditioner.