Semidefinite programming relaxations for linear semi-infinite polynomial programming
From MaRDI portal
Abstract: This paper studies a class of so-called linear semi-infinite polynomial programming (LSIPP) problems. It is a subclass of linear semi-infinite programming problems whose constraint functions are polynomials in parameters and index sets are basic semialgebraic sets. We present a hierarchy of semidefinite programming (SDP) relaxations for LSIPP problems. Convergence rate analysis of the SDP relaxations is established based on some existing results. We show how to verify the compactness of feasible sets of LSIPP problems. In the end, we extend the SDP relaxation method to more general semi-infinite programming problems.
Recommendations
- Semidefinite relaxations for semi-infinite polynomial programming
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- Semidefinite programming relaxations for semialgebraic problems
- scientific article; zbMATH DE number 1985305
- LP relaxations for a class of linear semi-infinite programming problems
- Semidefinite relaxations for integer programming
- On the Lasserre hierarchy of semidefinite programming relaxations of convex polynomial optimization problems
- Semidefinite programming in combinatorial and polynomial optimization
- Solving polynomial least squares problems via semidefinite programming relaxations
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
Cited in
(13)- An algorithm for semi-infinite polynomial optimization
- Semi-infinite programming using high-degree polynomial interpolants and semidefinite programming
- On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems
- How to generate weakly infeasible semidefinite programs via Lasserre's relaxations for polynomial optimization
- On solving a class of linear semi-infinite programming by SDP method
- An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- scientific article; zbMATH DE number 1985306 (Why is no real title available?)
- LP relaxations for a class of linear semi-infinite programming problems
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations
- scientific article; zbMATH DE number 5564089 (Why is no real title available?)
- Semidefinite relaxations for semi-infinite polynomial programming
- SDP vs. LP Relaxations for the Moment Approach in Some Performance Evaluation Problems
This page was built for publication: Semidefinite programming relaxations for linear semi-infinite polynomial programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151640)
