Partitioning procedure for polynomial optimization
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- P. M. Kleniati & Panos Parpas & Berc Rustem, 2009. "Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems," Working Papers 022, COMISEF.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- V. Jeyakumar & S. Kim & G. M. Lee & G. Li, 2016. "Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets," Journal of Global Optimization, Springer, vol. 65(2), pages 175-190, June.
More about this item
KeywordsPolynomial optimization; Positivstellensatz; Sum of squares; Benders decomposition;
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:spr:jglopt:v:48:y:2010:i:4:p:549-567. 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: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: http://www.springer.com .