A solver-agnostic condensing reformulation for linear-quadratic optimization with polyhedral and geometric constraints that preserves augmented-Lagrangian convergence while improving computational speed.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A condensing approach for linear-quadratic optimization with geometric constraints
A solver-agnostic condensing reformulation for linear-quadratic optimization with polyhedral and geometric constraints that preserves augmented-Lagrangian convergence while improving computational speed.