Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs

DOI10.1137/100802190MaRDI QIDQ3004990zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Bissan Ghaddar, Miguel F. Anjos, Juan 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

binary quadratic polynomial programpolynomial programmingsecond-order conesum-of-squares

Mathematics Subject Classification ID

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

Recommendations

• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Second order cone programming relaxation for quadratic assignment problems
• Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
• Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
• Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
• A semidefinite relaxation method for second-order cone polynomial complementarity problems
• Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint
• The \(Q\) method for second order cone programming
• Semidefinite relaxation method for polynomial optimization with second-order cone complementarity constraints
• scientific article; zbMATH DE number 2050896

Cited in

(17)

• A fresh CP look at mixed-binary QPs: new formulations and relaxations
• Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
• Binary quadratic optimization problems that are difficult to solve by conic relaxations
• Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
• Alternative SDP and SOCP approximations for polynomial optimization
• New SOCP relaxation and branching rule for bipartite bilinear programs
• The \(Q\) method for second order cone programming
• A dynamic inequality generation scheme for polynomial programming
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
• On linear conic relaxation of discrete quadratic programs
• An iterative scheme for valid polynomial inequality generation in binary polynomial programming
• Semidefinite relaxations for mixed 0-1 second-order cone program
• Bounds for random binary quadratic programs
• Robust optimization of sums of piecewise linear functions with application to inventory problems
• Polynomial optimization: tightening RLT-based branch-and-bound schemes with conic constraints
• Degree reduction techniques for polynomial optimization problems

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)