A matrix-free interior point augmented Lagrangian trajectory, defined by an ODE, is proven to converge from any interior feasible point to an optimal solution of linearly constrained convex programs.
Functions of a real variable
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
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
A matrix-free interior point continuous trajectory for linearly constrained convex programming
A matrix-free interior point augmented Lagrangian trajectory, defined by an ODE, is proven to converge from any interior feasible point to an optimal solution of linearly constrained convex programs.