Necessary conditions and duality for inexact nonlinear semi-infinite programming problems
From MaRDI portal
Publication:2466781
DOI10.1007/s00186-006-0099-8zbMath1126.90069OpenAlexW1969804915MaRDI QIDQ2466781
Juan Alfredo Gómez, Paul Bosch
Publication date: 16 January 2008
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-006-0099-8
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Applications of second-order cone programming
- Discretization methods for the solution of semi-infinite programming problems
- Second-order cone programming
- Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
- Integrals which are convex functionals. II
- A successive SDP-NSDP approach to a robust optimization problem in finance
- Strong duality for inexact linear programming
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- Duality for inexact linear programming problems∗
- Semi-Infinite Programming: Theory, Methods, and Applications
- Cutting plane algorithms for robust conic convex optimization problems
- Connections between generalized, inexact and semi-infinite linear programming
- An implementation of a discretization method for semi-infinite programming
- Direct theorems in semi-infinite convex programming
- Some generalization of inexact linear programming
- Strong Duality for Semidefinite Programming
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
- Semidefinite Programming
- Duality for inexact semi-infinite linear programming
- Extremum problems in the presence of restrictions
- Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
This page was built for publication: Necessary conditions and duality for inexact nonlinear semi-infinite programming problems