A path-following smoothing Newton method for symmetric cone programming achieves O(sqrt(nu) ln(1/eps)) iteration complexity via a newly introduced self-concordant convex-concave reduced SBAL function that induces a central path.
In: 2013 European Control Conference (ECC), pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polynomial iteration complexity of a path-following smoothing Newton method for symmetric cone programming
A path-following smoothing Newton method for symmetric cone programming achieves O(sqrt(nu) ln(1/eps)) iteration complexity via a newly introduced self-concordant convex-concave reduced SBAL function that induces a central path.