Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces

MaRDI QIDQ6629773FDOQ6629773

Authors A. Rikouane, Mohamed Laghdir, Mohamed Mabrouk

Publication date 30 October 2024

Published in Graduate Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Calculus of variations and optimal control; optimization (49-XX)

Recommendations

• Strong and total Fenchel dualities for robust convex optimization problems
• Stable and total Fenchel duality for composed convex optimization problems
• Stable and total Fenchel dualities for DC composite optimization problems in locally convex spaces
• Stable and total Fenchel duality for convex optimization problems in locally convex spaces
• scientific article; zbMATH DE number 7709322

Cites work

• scientific article; zbMATH DE number 6673745 (Why is no real title available?)
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 734672 (Why is no real title available?)
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• A note on subdifferentials of convex composite functionals
• A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
• Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
• Conjugate duality in convex optimization
• Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
• Robust conjugate duality for convex optimization under uncertainty with application to data classification
• Robust location transportation problems under uncertain demands
• Robust solutions of uncertain linear programs
• Some characterizations of robust optimal solutions for uncertain convex optimization problems
• Strong and total Fenchel dualities for robust convex optimization problems
• Strong duality in robust convex programming: complete characterizations
• Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions

Cited in

(1)

• Strong and total duality for constrained composed optimization via a coupling conjugation scheme

This page was built for publication: Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces

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