A note on perfect duality and limiting lagrangeans
From MaRDI portal
Publication:3880596
DOI10.1007/BF01588327zbMATH Open0438.90072DBLPjournals/mp/Borwein80OpenAlexW1994982697WikidataQ56936037 ScholiaQ56936037MaRDI QIDQ3880596FDOQ3880596
Publication date: 1980
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588327
convex dualityclosuresemi-infinite programsconvex conjugatesperfect dualityduality gapsgeneral closure conditionslimiting Lagrangeansperturbed sequence of programs
Cites Work
- Convex Analysis
- Title not available (Why is that?)
- Constructing a perfect duality in infinite programming
- Title not available (Why is that?)
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- An Infinite Linear Program with a Duality Gap
- Lagrangean functions and affine minorants
- Convex analysis treated by linear programming
Cited In (12)
- Zero duality gaps in infinite-dimensional programming
- A note on limiting infisup theorems
- A note on d-stability of convex programs and limiting Lagrangians
- Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
- Duality for convex infinite optimization on linear spaces
- Reduction and Discrete Approximation in Linear Semi-Infinite Programming
- Perfect duality for convexlike programs
- Limiting Lagrangians: A primal approach
- The limiting Lagrangian as a consequence of Helly's theorem
- A limiting infisup theorem
- A duality theorem for semi-infinite convex programs and their finite subprograms
- Duality gaps in semi-infinite linear programming—an approximation problem
This page was built for publication: A note on perfect duality and limiting lagrangeans
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3880596)
