Uniform duality in semi-infinite convex optimization

DOI10.1007/BF02591942zbMath0556.49008MaRDI QIDQ3219365

Robert G. Jeroslow

Publication date: 1983

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

duality gap; convex objective function; Helly-type theorems; Lagrangean duality

Mathematics Subject Classification ID

90C25: Convex programming

90C34: Semi-infinite programming

49N15: Duality theory (optimization)

52A35: Helly-type theorems and geometric transversal theory

Related Items

Robust linear semi-infinite programming duality under uncertainty, Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions, In a semi-infinite program only a countable subset of the constraints is essential, Zero duality gaps in infinite-dimensional programming, Necessary and sufficient constraint qualifications for solvability of systems of infinite convex inequalities, A duality theorem for semi-infinite convex programs and their finite subprograms, Optimality conditions for nondifferentiable convex semi-infinite programming, Reduction and Discrete Approximation in Linear Semi-Infinite Programming

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