A ladder method for linear semi-infinite programming
From MaRDI portal
Publication:380573
DOI10.3934/jimo.2014.10.397zbMath1281.90076OpenAlexW1997096856MaRDI QIDQ380573
Publication date: 14 November 2013
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2014.10.397
Optimality conditions and duality in mathematical programming (90C46) Semi-infinite programming (90C34)
Related Items (4)
Generalized corner optimal solution for LSIP: existence and numerical computation ⋮ Recent contributions to linear semi-infinite optimization ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ Asymptotic optimality conditions for linear semi-infinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new quadratic semi-infinite programming algorithm based on dual parametrization
- An exterior point linear programming method based on inclusive normal cones
- Duality in linear programming: from trichotomy to quadrichotomy
- An interior point algorithm for semi-infinite linear programming
- Discretization methods for the solution of semi-infinite programming problems
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- An extension of the simplex algorithm for semi-infinite linear programming
- A logarithmic barrier cutting plane method for convex programming
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- Proximal interior point method for convex semi-infinite programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- An implementation of a discretization method for semi-infinite programming
- A bridging method for global optimization
- A dual parametrization method for convex semi-infinite programming
This page was built for publication: A ladder method for linear semi-infinite programming
