On a zero duality gap result in extended monotropic programming
From MaRDI portal
Abstract: In this note we correct and improve a zero duality gap result in extended monotropic programming given by Bertsekas in [1].
Recommendations
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3961334 (Why is no real title available?)
- scientific article; zbMATH DE number 3504682 (Why is no real title available?)
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Constraint qualifications for extended Farkas's lemmas and Lagrangian dualities in convex infinite programming
- Convex Analysis
- Extended monotropic programming and duality
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- On the subdifferential of the supremum of an arbitrary family of extended real-valued functions
- Stable and total Fenchel duality for convex optimization problems in locally convex spaces
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Subdifferential calculus using -subdifferentials
Cited in
(5)- An approach for the convex feasibility problem via monotropic programming
- Algebraic approach to duality in optimization and applications
- Min-sup-type zero duality gap properties for DC composite optimization problem
- Duality for extended infinite monotropic optimization problems
- Stable zero Lagrange duality for DC conic programming
This page was built for publication: On a zero duality gap result in extended monotropic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q620434)