The limiting Lagrangian as a consequence of Helly's theorem
From MaRDI portal
Publication:1136348
DOI10.1007/BF00935755zbMath0427.49029OpenAlexW2033159801WikidataQ56936034 ScholiaQ56936034MaRDI QIDQ1136348
Publication date: 1981
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00935755
Convex programming (90C25) Numerical methods involving duality (49M29) Semi-infinite programming (90C34) Methods of successive quadratic programming type (90C55)
Related Items (11)
In a semi-infinite program only a countable subset of the constraints is essential ⋮ Semi-infinite programming ⋮ A limiting infisup theorem ⋮ A note on d-stability of convex programs and limiting Lagrangians ⋮ A duality theorem for semi-infinite convex programs and their finite subprograms ⋮ A purification algorithm for semi-infinite programming ⋮ A note on limiting infisup theorems ⋮ Duality gaps in semi-infinite linear programming—an approximation problem ⋮ Limiting Lagrangians: A primal approach ⋮ A primal-dual projection method for solving systems of linear inequalities ⋮ Convex semi-infinite games
Cites Work
- Unnamed Item
- Unnamed Item
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- Projection and restriction methods in geometric programming and related problems
- Constructing a perfect duality in infinite programming
- On semi-infinite systems of linear inequalities
- Duality in Semi-Infinite Programs and Some Works of Haar and Carathéodory
- A note on perfect duality and limiting lagrangeans
- An Infinite Linear Program with a Duality Gap
- Convex Analysis
- Convex analysis treated by linear programming
This page was built for publication: The limiting Lagrangian as a consequence of Helly's theorem
