Derives first- and second-order necessary and sufficient optimality conditions for directional local minimality in unconstrained nonsmooth optimization and adapts them to nondirectional local minimality using critical directions.
SIAM Journal on Optimization 24(2), 898-931 (2014)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
math.OC 3years
2026 3roles
background 1polarities
background 1representative citing papers
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.
Piecewise M-stationarity is equivalent to B-stationarity for MPCCs under MPCC-ACQ and reduces the cost of verifying stationarity for NCP-based algorithms.
citing papers explorer
-
On directional local minimality and directional optimality conditions in nonsmooth optimization
Derives first- and second-order necessary and sufficient optimality conditions for directional local minimality in unconstrained nonsmooth optimization and adapts them to nondirectional local minimality using critical directions.
-
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.
-
Piecewise M-Stationarity and Related Algorithms for Mathematical Programs with Complementarity Constraints
Piecewise M-stationarity is equivalent to B-stationarity for MPCCs under MPCC-ACQ and reduces the cost of verifying stationarity for NCP-based algorithms.