Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization
AbstractWe observe that in a simple one-dimensional polynomial optimization problem (POP), the ‘optimal’ values of semidefinite programming (SDP) relaxation problems reported by the standard SDP solvers converge to the optimal value of the POP, while the true optimal values of SDP relaxation problems are strictly and significantly less than that value. Some pieces of circumstantial evidences for the strange behaviors of the SDP solvers are given. This result gives a warning to users of the SDP relaxation method for POPs to be careful in believing the results of the SDP solvers. We also demonstrate how SDPA-GMP, a multiple precision SDP solver developed by one of the authors, can deal with this situation correctly. Copyright Springer Science+Business Media, LLC 2012
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Computational Optimization and Applications.
Volume (Year): 53 (2012)
Issue (Month): 3 (December)
Contact details of provider:
Web page: http://www.springer.com/math/journal/10589
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.