Uniform duality in semi-infinite convex optimization
From MaRDI portal
Publication:3219365
DOI10.1007/BF02591942zbMath0556.49008OpenAlexW1967419109MaRDI QIDQ3219365
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02591942
Convex programming (90C25) Semi-infinite programming (90C34) Duality theory (optimization) (49N15) Helly-type theorems and geometric transversal theory (52A35)
Related Items
In a semi-infinite program only a countable subset of the constraints is essential, Robust linear semi-infinite programming duality under uncertainty, Approximate solution in robust multi-objective optimization and its application in portfolio optimization, Reduction and Discrete Approximation in Linear Semi-Infinite Programming, A duality theorem for semi-infinite convex programs and their finite subprograms, Optimality conditions for nondifferentiable convex semi-infinite programming, Revisiting some rules of convex analysis, Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities, Exact relaxations for parametric robust linear optimization problems, Zero duality gaps in infinite-dimensional programming, Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- A note on infinite systems of linear inequalities in R\(^n\)
- Programmes in Paired Spaces
- Duality gaps in semi-infinite linear programming—an approximation problem
- Lagrangean functions and affine minorants
- Direct theorems in semi-infinite convex programming
- Convex optimization and lagrange multipliers
- An Infinite Linear Program with a Duality Gap
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Convex Analysis
- The Critical Set of a Convex Body
