On the Identification of Active Constraints II: The Nonconvex Case

From MaRDI portal
Publication:3482763

DOI10.1137/0727064zbMath0703.65034OpenAlexW2072808760MaRDI QIDQ3482763

Jim Burke

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




Related Items

A Trust-region Method for Nonsmooth Nonconvex OptimizationA proximal method for composite minimizationProximal methods avoid active strict saddles of weakly convex functionsA stable primal-dual approach for linear programming under nondegeneracy assumptionsPartial Smoothness and Constant RankError bounds in mathematical programmingScreening for a reweighted penalized conditional gradient methodActive-Set Identification with Complexity Guarantees of an Almost Cyclic 2-Coordinate Descent Method with Armijo Line SearchOn the stationarity for nonlinear optimization problems with polyhedral constraintsInfeasibility Detection with Primal-Dual Hybrid Gradient for Large-Scale Linear ProgrammingStopping rules and backward error analysis for bound-constrained optimizationActive Set Complexity of the Away-Step Frank--Wolfe AlgorithmOptimality, identifiability, and sensitivityGlobal Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPsHybrid approach with active set identification for mathematical programs with complementarity constraintsGeneric Minimizing Behavior in Semialgebraic OptimizationNew active set identification for general constrained optimization and minimax problemsFirst-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe VariantsActive‐Set Newton Methods and Partial SmoothnessGeometrical 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