Strong and total Fenchel dualities for robust composed convex optimization problems in locally convex spaces
From MaRDI portal
Publication:6629773
Mohamed Laghdir, A. Rikouane, Mohamed Mabrouk
Publication date: 30 October 2024
Published in: Graduate Journal of Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some characterizations of robust optimal solutions for uncertain convex optimization problems
- Robust location transportation problems under uncertain demands
- Robust conjugate duality for convex optimization under uncertainty with application to data classification
- Conjugate duality in convex optimization
- Robust solutions of uncertain linear programs
- A note on subdifferentials of convex composite functionals
- Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
- Strong and total Fenchel dualities for robust convex optimization problems
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Strong Duality in Robust Convex Programming: Complete Characterizations
- A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
- Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
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)
