Optimality conditions via exact penalty functions
DOI10.1137/090771016zbMATH Open1229.90202OpenAlexW2074375256MaRDI QIDQ3083328FDOQ3083328
Publication date: 21 March 2011
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/4767
Recommendations
- First- and second-order necessary conditions via exact penalty functions
- Lagrange Multipliers and Calmness Conditions of Order p
- Exact Penalty Functions in Constrained Optimization
- Exact penalties and sufficient conditions for optimality in nonsmooth optimization
- Exact penalty and necessary optimality conditions in constrained optimization
exact penalty functionmathematical programs with complementarity constraintsnonlinear programming problemstrong stationarityMordukhovich stationarityKKT optimality condition
Optimality conditions and duality in mathematical programming (90C46) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (17)
- Penalty functions in subanalytic optimization
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- First- and second-order necessary conditions via exact penalty functions
- Optimality conditions for semi-infinite and generalized semi-infinite programs via lower order exact penalty functions
- Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
- Sufficient conditions for extremum, penalty functions and regularity
- Second-order enhanced optimality conditions and constraint qualifications
- Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
- Use of exact penalty functions to determine efficient decisions
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Global optimality conditions and exact penalization
- Variational analysis on local sharp minima via exact penalization
- \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities
- Characterizing FJ and KKT Conditions in Nonconvex Mathematical Programming with Applications
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- A unifying theory of exactness of linear penalty functions
- Smoothing methods for nonsmooth, nonconvex minimization
This page was built for publication: Optimality conditions via exact penalty functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083328)
