Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems
Download full text from publisher
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Polyxeni-Margarita Kleniati & Panos Parpas & Berç Rustem, 2010. "Partitioning procedure for polynomial optimization," Journal of Global Optimization, Springer, vol. 48(4), pages 549-567, December.
More about this item
KeywordsPolynomial optimization; Semidefinite programming; Sparse SDP relaxations; Benders decomposition;
NEP fieldsThis paper has been announced in the following NEP Reports:
- NEP-ALL-2009-12-05 (All new papers)
StatisticsAccess and download statistics
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:com:wpaper:022. See general 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: (Anil Khuman). General contact details of provider: http://www.comisef.eu .
We have no references for this item. You can help adding them by using this form .