On solving a class of linear semi-infinite programming by SDP method
From MaRDI portal
Publication:4981874
DOI10.1080/02331934.2013.793325zbMath1311.90160OpenAlexW2006191109MaRDI QIDQ4981874
Publication date: 20 March 2015
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2013.793325
Related Items (10)
Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Recent contributions to linear semi-infinite optimization ⋮ An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials ⋮ Recent contributions to linear semi-infinite optimization: an update ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications ⋮ Unnamed Item ⋮ Exact relaxations for parametric robust linear optimization problems ⋮ On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems ⋮ Polynomial programming prevents aircraft (and other) conflicts
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A new smoothing Newton-type algorithm for semi-infinite programming
- An accelerated central cutting plane algorithm for linear semi-infinite programming
- Optimization theory and methods. Nonlinear programming
- A New Exchange Method for Convex Semi-Infinite Programming
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite optimization
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Polynomials that are positive on an interval
This page was built for publication: On solving a class of linear semi-infinite programming by SDP method
