Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

DOI10.1137/100802190zbMATH Open1242.90153DBLPjournals/siamjo/GhaddarVA11OpenAlexW2059380806WikidataQ58051150 ScholiaQ58051150MaRDI QIDQ3004990FDOQ3004990

Bissan Ghaddar, Juan Vera, Miguel F. Anjos

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

polynomial programmingsecond-order conesum-of-squaresbinary quadratic polynomial program

Mathematics Subject Classification ID

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

Cited In (8)

• A dynamic inequality generation scheme for polynomial programming
• The \(Q\) method for second order cone programming
• Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Alternative SDP and SOCP approximations for polynomial optimization
• Bounds for Random Binary Quadratic Programs
• An Iterative Scheme for Valid Polynomial Inequality Generation in Binary Polynomial Programming
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints

Recommendations

• Title not available (Why is that?) 👍 👎
• Second order cone programming relaxation of nonconvex quadratic optimization problems 👍 👎
• Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems 👍 👎
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming 👍 👎
• The \(Q\) method for second order cone programming 👍 👎
• Second order cone programming relaxation for quadratic assignment problems 👍 👎
• Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint 👍 👎
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems 👍 👎
• A semidefinite relaxation method for second-order cone polynomial complementarity problems 👍 👎
• Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004990)