On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems

DOI10.1007/s12597-023-00663-yOpenAlexW4383337552MaRDI QIDQ6059887

Tadeusz Antczak, Najeeb Abdulaleem

Publication date: 2 November 2023

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-023-00663-y

zbMATH Keywords

\(E\)-convex function\(E\)-Karush-Kuhn-Tucker necessary optimality conditions\(E\)-differentiable optimization problem\(l_1\) exactexactness of penalizationpenalized \(E\)-optimization problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact penalty functions method for mathematical programming problems involving invex functions
• Non-connected convexities and applications
• \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
• Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
• Optimality criteria in \(E\)-convex programming
• Optimality and duality results for \(E\)-differentiable multiobjective fractional programming problems under \(E\)-convexity
• \(E\)-differentiable minimax programming under \(E\)-convexity
• Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
• E-convexity and its generalizations
• A multiplier method with automatic limitation of penalty growth
• A Continuously Differentiable Exact Penalty Function for Nonlinear Programming Problems with Inequality Constraints
• Exact Penalties for Local Minima
• Exact penalty functions in nonlinear programming
• A lower bound for the controlling parameters of the exact penalty functions
• An exact penalty function for nonlinear programming with inequalities
• Exact Penalty Functions in Constrained Optimization
• The Exact l 1 Penalty Function Method for Constrained Nonsmooth Invex Optimization Problems
• Sufficiency of Exact Penalty Minimization
• Non-Linear Programming Via Penalty Functions