Application of the penalty function method to generalized convex programs

DOI10.1016/j.aml.2006.05.017zbMath1161.90462OpenAlexW2088656763MaRDI QIDQ2455425

Chandal Nahak

Publication date: 24 October 2007

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2006.05.017

zbMATH Keywords

dualityLagrangianpenalty functioninvex functionprimal-dual inequality

Mathematics Subject Classification ID

Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Related Items

Further study on strong Lagrangian duality property for invex programs via penalty functions ⋮ Penalization for variational inequalities

Cites Work

• The essence of invexity
• On sufficiency of the Kuhn-Tucker conditions
• A note on unconstrained reformulation of complementarity problem.
• What is invexity?
• Invex functions and constrained local minima
• Pseudo-Convex Functions