THE l1 PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS

DOI10.1142/S0217595910002855zbMath1203.90124MaRDI QIDQ3069758

Tadeusz Antczak

Publication date: 19 January 2011

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

exact penalty function methodpenalized optimization problem\(r\)-invex function with respect to \(\eta \)\(l_{1}\) exact penalty function

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)

Related Items (2)

The exact absolute value penalty function method for identifying strict global minima of order \(m\) in nonconvex nonsmooth programming ⋮ A lower bound for the penalty parameter in the exact minimax penalty function method for solving nondifferentiable extremum problems

Cites Work

• Unnamed Item
• Unnamed Item
• \(r\)-preinvexity and \(r\)-invexity in mathematical programming
• Exact penalty functions method for mathematical programming problems involving invex functions
• On sufficiency of the Kuhn-Tucker conditions
• A multiplier method with automatic limitation of penalty growth
• An exact penalty function method with global convergence properties for nonlinear programming problems
• Exact penalty functions in nonlinear programming
• On conditions for optimality of the nonlinearl 1 problem
• 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
• Sufficiency of Exact Penalty Minimization
• Non-Linear Programming Via Penalty Functions
• An Exact Potential Method for Constrained Maxima
• \((p,r)\)-invex sets and functions

This page was built for publication: THE l₁ PENALTY FUNCTION METHOD FOR NONCONVEX DIFFERENTIABLE OPTIMIZATION PROBLEMS WITH INEQUALITY CONSTRAINTS