On a zero duality gap result in extended monotropic programming
From MaRDI portal
Publication:620434
DOI10.1007/s10957-010-9733-yzbMath1229.90264arXiv1002.3272MaRDI QIDQ620434
Radu Ioan Boţ, Ernö Robert Csetnek
Publication date: 19 January 2011
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1002.3272
90C46: Optimality conditions and duality in mathematical programming
90C48: Programming in abstract spaces
Related Items
Stable zero Lagrange duality for DC conic 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, An approach for the convex feasibility problem via monotropic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the subdifferential of the supremum of an arbitrary family of extended real-valued functions
- Extended monotropic programming and duality
- Subdifferential calculus using \(\varepsilon\)-subdifferentials
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Functional Inequalities in the Absence of Convexity and Lower Semicontinuity with Applications to Optimization
- Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
- Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
- Subdifferential Calculus Rules in Convex Analysis: A Unifying Approach Via Pointwise Supremum Functions
- Convex Analysis