Further study on strong Lagrangian duality property for invex programs via penalty functions

DOI10.1155/2010/931590zbMATH Open1201.90150OpenAlexW2140618898WikidataQ59253594 ScholiaQ59253594MaRDI QIDQ608016FDOQ608016

Authors: Jie Zhang, Xuexiang Huang 

Publication date: 6 December 2010

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/233618

Recommendations

• Application of the penalty function method to generalized convex programs
• Penalty function methods and a duality gap for invex optimization problems
• scientific article; zbMATH DE number 3904354
• scientific article; zbMATH DE number 2221949
• scientific article; zbMATH DE number 3902413

Mathematics Subject Classification ID

Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)

Cites Work

• Variational Analysis
• What is invexity?
• Application of the penalty function method to generalized convex programs
• Some convex programs without a duality gap

Cited In (2)

• Penalty function methods and a duality gap for invex optimization problems
• Application of the penalty function method to generalized convex programs

This page was built for publication: Further study on strong Lagrangian duality property for invex programs via penalty functions

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