A duality theorem for semi-infinite convex programs and their finite subprograms
From MaRDI portal
Publication:3308653
DOI10.1007/BF02591965zbMath0527.49027MaRDI QIDQ3308653
Publication date: 1983
Published in: Mathematical Programming (Search for Journal in Brave)
Lagrange dualsemi-infinite convex programfinite subprogramtheory of recessionweak value of the primal program
Convex programming (90C25) Semi-infinite programming (90C34) Duality theory (optimization) (49N15) Methods of successive quadratic programming type (90C55)
Related Items (12)
Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality ⋮ In a semi-infinite program only a countable subset of the constraints is essential ⋮ Optimal value function in semi-infinite programming ⋮ Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints ⋮ A one-phase algorithm for semi-infinite linear programming ⋮ A note on d-stability of convex programs and limiting Lagrangians ⋮ A purification algorithm for semi-infinite programming ⋮ On constraint qualifications in nonsmooth optimization. ⋮ Zero duality gaps in infinite-dimensional programming ⋮ Limiting Lagrangians: A primal approach ⋮ Duality for convex infinite optimization on linear spaces ⋮ Convex semi-infinite games
Cites Work
- Unnamed Item
- Limiting Lagrangians: A primal approach
- The limiting Lagrangian as a consequence of Helly's theorem
- Clark's theorem for semi-infinite convex programs
- A pathological semi-infinite program verifying Karlovitz's conjecture
- Uniform duality in semi-infinite convex optimization
- A note on perfect duality and limiting lagrangeans
- Duality gaps in semi-infinite linear programming—an approximation problem
- Direct theorems in semi-infinite convex programming
- An Infinite Linear Program with a Duality Gap
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- Convex Analysis
This page was built for publication: A duality theorem for semi-infinite convex programs and their finite subprograms