On solving a class of linear semi-infinite programming by SDP method

DOI10.1080/02331934.2013.793325MaRDI QIDQ4981874zbMATH OpenOpenAlexFDO

Authors Yi Xu, Liqun Qi, Wenyu Sun

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

zbMATH Keywords

error boundsemi-infinite programmingsemi-definite programmingnonnegative polynomialSOS method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Semi-infinite programming (90C34)

Recommendations

• Semidefinite programming relaxations for linear semi-infinite polynomial programming
• Semidefinite relaxations for semi-infinite polynomial programming
• Solving semidefinite programs via discretization method for solving semiinfinite programming problems
• A perturbation method for solving linear semi-infinite programming problems
• An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming

Cites work

• scientific article; zbMATH DE number 1601019 (Why is no real title available?)
• scientific article; zbMATH DE number 527343 (Why is no real title available?)
• A new exchange method for convex semi-infinite programming
• 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
• Polynomials that are positive on an interval
• Semi-Infinite Programming: Theory, Methods, and Applications
• Semidefinite optimization
• Solving Semi-Infinite Optimization Problems with Interior Point Techniques
• Solving semidefinite-quadratic-linear programs using SDPT3

Cited in

(16)

• On solving a class of fractional semi-infinite polynomial programming problems
• Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
• On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
• Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the Slater condition
• An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
• Conic linear programming duals for classes of quadratic semi-infinite programs with applications
• scientific article; zbMATH DE number 3945873 (Why is no real title available?)
• Exact relaxations for parametric robust linear optimization problems
• Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
• Polynomial programming prevents aircraft (and other) conflicts
• Solving semidefinite programs via discretization method for solving semiinfinite programming problems
• LP relaxations for a class of linear semi-infinite programming problems
• Generalized semi-infinite polynomial optimization and semidefinite programming relaxations
• Recent contributions to linear semi-infinite optimization
• Semidefinite relaxations for semi-infinite polynomial programming
• Recent contributions to linear semi-infinite optimization: an update

This page was built for publication: On solving a class of linear semi-infinite programming by SDP method

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981874)