Enhancing RLT-based relaxations for polynomial programming problems via a new class of v-semidefinite cuts

Hanif Sherali (), Evrim Dalkiran () and Jitamitra Desai ()

Computational Optimization and Applications, 2012, vol. 52, issue 2, 483-506

Keywords: Polynomial programs; Reformulation-Linearization Technique (RLT); Semidefinite programming; BARON; GloptiPoly; Semidefinite cuts; Global optimization (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10589-011-9425-z (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:52:y:2012:i:2:p:483-506

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-011-9425-z

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().