Establishes O(√ν ln(1/ε)) iteration complexity for path-following smoothing Newton methods on symmetric cone programs via a new self-concordant reduced barrier augmented Lagrangian function and associated central path analysis.
Title resolution pending
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
Establishes O(√ν ln(1/ε)) iteration complexity for path-following smoothing Newton methods on symmetric cone programs via a new self-concordant reduced barrier augmented Lagrangian function and associated central path analysis.