The Fenchel-Lagrange dual of generalized convex optimization problem

MaRDI QIDQ3403368zbMATH OpenFDO

Authors Xiaolan Liu, Mi Zhou, Yiran He

Publication date 12 February 2010

zbMATH Keywords

conjugate functiondual problemgeneralized convex optimization problem

Mathematics Subject Classification ID

Duality theory (optimization) (49N15) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• Strong duality for generalized convex optimization problems
• Generalized constraints qualification conditions and infinite dimensional duality
• scientific article; zbMATH DE number 7294847
• New constraint qualification and conjugate duality for composed convex optimization problems
• Stable strong Fenchel and Lagrange duality for evenly convex optimization problems

Cited in

(9)

• Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme
• On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
• Weak Fenchel and weak Fenchel-Lagrange conjugate duality for nonconvex scalar optimization problems
• Fenchel duality theory and a primal-dual algorithm on Riemannian manifolds
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• scientific article; zbMATH DE number 5885195 (Why is no real title available?)
• scientific article; zbMATH DE number 29898 (Why is no real title available?)
• A new Fenchel dual problem in vector optimization
• Strong duality for generalized convex optimization problems

This page was built for publication: The Fenchel-Lagrange dual of generalized convex optimization problem

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