The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming
DOI10.1007/S11590-015-0967-3zbMATH Open1365.90208OpenAlexW2425372279WikidataQ59473691 ScholiaQ59473691MaRDI QIDQ331995FDOQ331995
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
Recommendations
- Exactness of the absolute value exact penalty function method for optimization problems via upper convexificators
- scientific article; zbMATH DE number 500377
- An exact lower order penalty function and its smoothing in nonlinear programming
- The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
- scientific article; zbMATH DE number 4010220
absolute value penalty functionexact \(l_{1}\) penalty function methodgeneralized Karush-Kuhn-Tucker optimality conditionslocally Lipschitz \((F, \rho) \)-convex functionpenalized optimization problem
Cites Work
- Title not available (Why is that?)
- Optimization and nonsmooth analysis
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Stability in Mathematical Programming with Nondifferentiable Data
- Exact penalty functions in nonlinear programming
- Nonlinear Programming
- Exact Penalty Functions in Constrained Optimization
- Non-Linear Programming Via Penalty Functions
- Title not available (Why is that?)
- An approach to constrained global optimization based on exact penalty functions
- Exact penalty functions and stability in locally Lipschitz programming
- Refinements of necessary optimality conditions in nondifferentiable programming. I
- 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
- Exact penalty functions a lower bound to the penalty parameter
- Exact Penalties for Local Minima
- Title not available (Why is that?)
- The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
- 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
- Sufficiency of Exact Penalty Minimization
- A Sufficient Condition for Exact Penalty in Constrained Optimization
Cited In (2)
This page was built for publication: The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q331995)
