Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/21159
Title: On solving a class of linear semi-infinite programming by SDP method
Authors: Xu, Y
Sun, W
Qi, L 
Keywords: Error bound
Nonnegative polynomial
Semi-definite programming
Semi-infinite programming
SOS method
Issue Date: 2015
Publisher: Taylor & Francis
Source: Optimization, 2015, v. 64, no. 3, p. 603-616 How to cite?
Journal: Optimization 
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.
URI: http://hdl.handle.net/10397/21159
ISSN: 0233-1934
EISSN: 1029-4945
DOI: 10.1080/02331934.2013.793325
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
0
Citations as of Aug 18, 2017

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Aug 23, 2017

Page view(s)

27
Last Week
1
Last month
Checked on Aug 20, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.