Penalty function methods and a duality gap for invex optimization problems

DOI10.1016/j.na.2009.01.233zbMath1171.90503MaRDI QIDQ923993

Tadeusz Antczak

Publication date: 24 July 2009

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2009.01.233

zbMATH Keywords

duality gap; penalty function method; penalized optimization problem; quadratic penalty function; invex function with respect to \(\eta \)

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C46: Optimality conditions and duality in mathematical programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The essence of invexity
• Some numerical experience with a globally convergent algorithm for nonlinearly constrained optimization
• Enlarging the region of convergence of Newton's method for constrained optimization
• On sufficiency of the Kuhn-Tucker conditions
• Generalized B-vex functions and generalized B-vex programming
• A class of \(B\)-(\(p\),\(r\))-invex functions and mathematical programming.
• Multiplier and gradient methods
• Ordinary convex programs without a duality gap
• Lagrange Multipliers and Optimality
• What is invexity?
• A class of nonconvex functions and mathematical programming
• Exact penalty functions in nonlinear programming
• Invex functions and constrained local minima
• On Penalty and Multiplier Methods for Constrained Minimization
• Combined Primal–Dual and Penalty Methods for Convex Programming
• Non-Linear Programming Via Penalty Functions
• Convergence Conditions for Nonlinear Programming Algorithms
• Augmented Lagrange Multiplier Functions and Duality in Nonconvex Programming
• \((p,r)\)-invex sets and functions