A duality theorem for semi-infinite convex programs and their finite subprograms
From MaRDI portal
Publication:3308653
Cites work
- scientific article; zbMATH DE number 3694044 (Why is no real title available?)
- A note on perfect duality and limiting lagrangeans
- A pathological semi-infinite program verifying Karlovitz's conjecture
- An Infinite Linear Program with a Duality Gap
- Clark's theorem for semi-infinite convex programs
- Convex Analysis
- Direct theorems in semi-infinite convex programming
- Duality gaps in semi-infinite linear programming—an approximation problem
- Limiting Lagrangians: A primal approach
- On Representations of Semi-Infinite Programs which Have No Duality Gaps
- The limiting Lagrangian as a consequence of Helly's theorem
- Uniform duality in semi-infinite convex optimization
Cited in
(12)- Relaxed Lagrangian duality in convex infinite optimization: reducibility and strong duality
- Convex semi-infinite games
- On constraint qualifications in nonsmooth optimization.
- Limiting Lagrangians: A primal approach
- Optimal value function in semi-infinite programming
- A purification algorithm for semi-infinite programming
- Zero duality gaps in infinite-dimensional programming
- A one-phase algorithm for semi-infinite linear programming
- In a semi-infinite program only a countable subset of the constraints is essential
- Duality for convex infinite optimization on linear spaces
- A note on d-stability of convex programs and limiting Lagrangians
- Optimality and duality analysis for multiobjective interval-valued semi-Infinite optimization problem having vanishing constraints
This page was built for publication: A duality theorem for semi-infinite convex programs and their finite subprograms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3308653)
