Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint

DOI10.1080/1055678031000148696MaRDI QIDQ4653548zbMATH OpenOpenAlexFDO

Authors Sunyoung Kim, Masakazu Kojima, Makoto Yamashita

Publication date 7 March 2005

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/1055678031000148696

Mathematics Subject Classification ID

Quadratic programming (90C20) Semidefinite programming (90C22)

Recommendations

• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
• Further relationship between second-order cone and positive semidefinite matrix cone
• On equivalence of semidefinite relaxations for quadratic matrix programming
• Simplified semidefinite and completely positive relaxations

Cites work

• A Spectral Bundle Method for Semidefinite Programming
• Applications of second-order cone programming
• Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
• Second order cone programming relaxation of nonconvex quadratic optimization problems

Cited in

(16)

• A note on treating a second order cone program as a special case of a semidefinite program
• Penalized semidefinite programming for quadratically-constrained quadratic optimization
• Naive constant rank-type constraint qualifications for multifold second-order cone programming and semidefinite programming
• The parameter-Newton iteration for the second-order cone linear complementarity problem
• Outer approximation with conic certificates for mixed-integer convex problems
• On polyhedral and second-order cone decompositions of semidefinite optimization problems
• On representing the positive semidefinite cone using the second-order cone
• Second order cone programming relaxation of nonconvex quadratic optimization problems
• Global approaches for facility layout and VLSI floorplanning
• Further relationship between second-order cone and positive semidefinite matrix cone
• Kronecker product constraints with an application to the two-trust-region subproblem
• Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
• scientific article; zbMATH DE number 7317464 (Why is no real title available?)
• A second-order cone cutting surface method: Complexity and application
• Conic mixed-integer rounding cuts
• A matrix generation approach for eigenvalue optimization

This page was built for publication: Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint

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