A note on d-stability of convex programs and limiting Lagrangians
From MaRDI portal
Publication:1184349
DOI10.1007/BF01585706zbMath0749.90059MaRDI QIDQ1184349
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585706
90C25: Convex programming
90C31: Sensitivity, stability, parametric optimization
90C34: Semi-infinite programming
Related Items
Revisiting some rules of convex analysis, On epsilon-stability in optimization, On duality gap in linear conic problems, On convergence of closed convex sets, One-sided derivatives for the value function in convex parametric programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limiting Lagrangians: A primal approach
- The limiting Lagrangian as a consequence of Helly's theorem
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\)
- A limiting infisup theorem
- Closedness conditions for the optimality of a family of non-convex optimization problems
- A duality theorem for semi-infinite convex programs and their finite subprograms
- Adjoint Process Duality
- A note on limiting infisup theorems
- A note on perfect duality and limiting lagrangeans
- On an abstract control problem
- Convex Analysis