Composed convex programming: duality and Farkas-type results

MaRDI QIDQ5431492zbMATH OpenFDO

Authors Radu I. Boţ, Ioan Bogdan Hodrea, Gert Wanka

Publication date 11 December 2007

zbMATH Keywords

composed convex functionsconjugate dualityconjugate functionsFarkas-type results

Mathematics Subject Classification ID

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

Recommendations

• Farkas-type results for general composed convex optimization problems with inequality constraints
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• New constraint qualification and conjugate duality for composed convex optimization problems
• Stable and total Fenchel duality for composed convex optimization problems
• Farkas-Type Results With Conjugate Functions

Cited in

(11)

• Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
• New constraint qualification and conjugate duality for composed convex optimization problems
• Farkas-type results for inequality systems with composed convex functions via conjugate duality
• scientific article; zbMATH DE number 6500589 (Why is no real title available?)
• Generalized Moreau–Rockafellar results for composed convex functions
• Composite convex programs
• A new approach to strong duality for composite vector optimization problems
• scientific article; zbMATH DE number 7294847 (Why is no real title available?)
• Farkas-type results for general composed convex optimization problems with inequality constraints
• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• -optimality conditions for composed convex optimization problems

This page was built for publication: Composed convex programming: duality and Farkas-type results

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