Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

DOI10.1137/100802190zbMath1242.90153OpenAlexW2059380806WikidataQ58051150 ScholiaQ58051150MaRDI QIDQ3004990

Bissan Ghaddar, Miguel F. Anjos, Juan Carlos Vera

Publication date: 6 June 2011

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/fdf451ede9f0406f9a08a764d69d248a41fc862c

zbMATH Keywords

second-order conesum-of-squarespolynomial programmingbinary quadratic polynomial program

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items (6)

Bounds for Random Binary Quadratic Programs ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming ⋮ Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems ⋮ Alternative SDP and SOCP approximations for polynomial optimization ⋮ A dynamic inequality generation scheme for polynomial programming

This page was built for publication: Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs