The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
From MaRDI portal
Publication:331995
DOI10.1007/s11590-015-0967-3zbMath1365.90208OpenAlexW2425372279WikidataQ59473691 ScholiaQ59473691MaRDI QIDQ331995
Publication date: 27 October 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0967-3
absolute value penalty functionexact \(l_{1}\) penalty function methodgeneralized Karush-Kuhn-Tucker optimality conditionslocally Lipschitz \((F, \rho) \)-convex functionpenalized optimization problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
- An approach to constrained global optimization based on exact penalty functions
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
- THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
- Stability in Mathematical Programming with Nondifferentiable Data
- Exact penalty functions a lower bound to the penalty parameter
- Optimization and nonsmooth analysis
- Exact penalty functions and stability in locally Lipschitz programming
- Exact Penalties for Local Minima
- Exact penalty functions in nonlinear programming
- On optimality conditions in nondifferentiable programming
- A lower bound for the controlling parameters of the exact penalty functions
- Characterizations of strict local minima for some nonlinear programming problems
- An exact penalty function for nonlinear programming with inequalities
- ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences
- Sufficient conditions for the stability of local minimum points in nonsmooth optimization
- Exact Penalty Functions in Constrained Optimization
- Sufficiency of Exact Penalty Minimization
- A Sufficient Condition for Exact Penalty in Constrained Optimization
- Nonlinear Programming
- Non-Linear Programming Via Penalty Functions
