Enhanced Fritz John Conditions for Convex Programming

DOI10.1137/040613068MaRDI QIDQ5470219zbMATH OpenOpenAlexFDO

Authors Dimitri P. Bertsekas, Asuman Ozdaglar, Paul Tseng

Publication date 30 May 2006

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/61697ee6abdde148e73c5cad0c6e2d51b27e5466

zbMATH Keywords

convex programdualityFritz John multipliergeometric multipliersensitivity analysis

Mathematics Subject Classification ID

Convex programming (90C25) Sensitivity, stability, parametric optimization (90C31) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Improved enhanced Fritz John condition and constraints qualifications using convexificators
• scientific article; zbMATH DE number 4119966
• Fritz John's type conditions and associated duality forms in convex non differentiable vector-optimization
• Remarks on Fritz John conditions for problems with inequality and equality constraints
• A sharp Lagrange multiplier theorem for nonlinear programs

Cited in

(6)

• Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
• Characterizing FJ and KKT conditions in nonconvex mathematical programming with applications
• Enhanced Karush-Kuhn-Tucker condition and weaker constraint qualifications
• A sequential optimality condition related to the quasi-normality constraint qualification and its algorithmic consequences
• Second-order enhanced optimality conditions and constraint qualifications
• On enhanced KKT optimality conditions for smooth nonlinear optimization

This page was built for publication: Enhanced Fritz John Conditions for Convex Programming

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