The exact absolute value penalty function method for identifying strict global minima of order m in nonconvex nonsmooth programming

DOI10.1007/S11590-015-0967-3MaRDI QIDQ331995zbMATH OpenOpenAlexWikidataFDO

Authors Tadeusz Antczak

Publication date 27 October 2016

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-015-0967-3

zbMATH Keywords

absolute value penalty functionexact \(l_{1}\) penalty function methodgeneralized Karush-Kuhn-Tucker optimality conditionslocally Lipschitz \((F, \rho) \)-convex functionpenalized optimization problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

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

Cites work

• scientific article; zbMATH DE number 3914081 (Why is no real title available?)
• scientific article; zbMATH DE number 41026 (Why is no real title available?)
• A Sufficient Condition for Exact Penalty in Constrained Optimization
• A lower bound for the controlling parameters of the exact penalty functions
• An approach to constrained global optimization based on exact penalty functions
• An exact penalty function for nonlinear programming with inequalities
• Characterizations of strict local minima and necessary conditions for weak sharp minima
• Characterizations of strict local minima for some nonlinear programming problems
• Exact Penalties for Local Minima
• Exact Penalty Functions in Constrained Optimization
• Exact penalty functions a lower bound to the penalty parameter
• Exact penalty functions and stability in locally Lipschitz programming
• Exact penalty functions in nonlinear programming
• Non-Linear Programming Via Penalty Functions
• Nonlinear Programming
• On optimality conditions in nondifferentiable programming
• Optimization and nonsmooth analysis
• Refinements of necessary optimality conditions in nondifferentiable programming. I
• Stability in Mathematical Programming with Nondifferentiable Data
• Stable local minimizers in semi-infinite optimization: Regularity and second-order conditions
• Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
• Sufficiency of Exact Penalty Minimization
• Sufficient conditions for the stability of local minimum points in nonsmooth optimization
• THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS
• The \(l_1\) exact exponential penalty function method with \((p,r)-\rho-(\eta,\theta)\)-invexity
• The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
• ρ-Invex Functions and ( F , ρ)Convex Functions: Properties and Equivalences

Cited in

(4)

• Strict minimizers of order \(m\) in nonsmooth optimization problems.
• Exactness of the absolute value penalty function method for nonsmooth ‐invex optimization problems
• Exactness of the absolute value exact penalty function method for optimization problems via upper convexificators
• Exactness property of the exact absolute value penalty function method for solving convex nondifferentiable interval-valued optimization problems

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)