Approximate directional stationarity is formulated as a necessary optimality condition for nonsmooth constrained problems, with a qualification condition using one sequence to infer directional stationarity.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
A solver-agnostic condensing reformulation for linear-quadratic optimization with polyhedral and geometric constraints that preserves augmented-Lagrangian convergence while improving computational speed.
citing papers explorer
-
Approximate directional stationarity and associated qualification conditions
Approximate directional stationarity is formulated as a necessary optimality condition for nonsmooth constrained problems, with a qualification condition using one sequence to infer directional stationarity.
-
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.