Penalty function methods and a duality gap for invex optimization problems

DOI10.1016/J.NA.2009.01.233MaRDI QIDQ923993zbMATH OpenOpenAlexFDO

Authors 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 gapinvex function with respect to \(\eta \)penalized optimization problempenalty function methodquadratic penalty function

Mathematics Subject Classification ID

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

Recommendations

• Application of the penalty function method to generalized convex programs
• Exact penalty functions method for mathematical programming problems involving invex functions
• The exact \(G\)-penalty function method and \(G\)-invex mathematical programming problems
• scientific article; zbMATH DE number 1880839
• Further study on strong Lagrangian duality property for invex programs via penalty functions

Cites work

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

Cited in

(3)

• Application of the penalty function method to generalized convex programs
• Further study on strong Lagrangian duality property for invex programs via penalty functions
• An inner approximation method incorporating with a penalty function method for a reverse convex programming problem

This page was built for publication: Penalty function methods and a duality gap for invex optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q923993)