On the Identification of Active Constraints II: The Nonconvex Case
From MaRDI portal
Publication:3482763
DOI10.1137/0727064zbMath0703.65034OpenAlexW2072808760MaRDI QIDQ3482763
Publication date: 1990
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0727064
algorithmsSQP algorithmidentification of active constraintsQL algorithmnonconvex constrained nonlinear programming
Related Items
A Trust-region Method for Nonsmooth Nonconvex Optimization ⋮ A proximal method for composite minimization ⋮ Proximal methods avoid active strict saddles of weakly convex functions ⋮ A stable primal-dual approach for linear programming under nondegeneracy assumptions ⋮ Partial Smoothness and Constant Rank ⋮ Error bounds in mathematical programming ⋮ Screening for a reweighted penalized conditional gradient method ⋮ Active-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line Search ⋮ On the stationarity for nonlinear optimization problems with polyhedral constraints ⋮ Infeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear Programming ⋮ Stopping rules and backward error analysis for bound-constrained optimization ⋮ Active Set Complexity of the Away-Step Frank--Wolfe Algorithm ⋮ Optimality, identifiability, and sensitivity ⋮ Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs ⋮ Hybrid approach with active set identification for mathematical programs with complementarity constraints ⋮ Generic Minimizing Behavior in Semialgebraic Optimization ⋮ New active set identification for general constrained optimization and minimax problems ⋮ First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants ⋮ Active‐Set Newton Methods and Partial Smoothness ⋮ Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems
This page was built for publication: On the Identification of Active Constraints II: The Nonconvex Case