Abstract
In this paper, we present a new method to solve linear semi-infinite programming. This method bases on the fact that the nonnegative polynomial on (Formula presented.) could be turned into a positive semi-definite system, so we can use the nonnegative polynomials to approximate the semi-infinite constraint. Furthermore, we set up an approximate programming for the primal linear semi-infinite programming, and obtain an error bound between two programming problems. Numerical results show that our method is efficient.
| Original language | English |
|---|---|
| Pages (from-to) | 603-616 |
| Number of pages | 14 |
| Journal | Optimization |
| Volume | 64 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1 Jan 2015 |
Keywords
- error bound
- nonnegative polynomial
- semi-definite programming
- semi-infinite programming
- SOS method
ASJC Scopus subject areas
- Control and Optimization
- Management Science and Operations Research
- Applied Mathematics