Second Order Cone Programming Relaxation of a Positive Semidefinite Constraint

DOI10.1080/1055678031000148696zbMath1142.90466OpenAlexW2054908450MaRDI QIDQ4653548

Sunyoung Kim, Makoto Yamashita, Kojima, Masakazu

Publication date: 7 March 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (8)

The parameter-Newton iteration for the second-order cone linear complementarity problem ⋮ A second-order cone cutting surface method: Complexity and application ⋮ Conic mixed-integer rounding cuts ⋮ A matrix generation approach for eigenvalue optimization ⋮ Outer approximation with conic certificates for mixed-integer convex problems ⋮ Penalized semidefinite programming for quadratically-constrained quadratic optimization ⋮ Global Approaches for Facility Layout and VLSI Floorplanning ⋮ Further relationship between second-order cone and positive semidefinite matrix cone

Cites Work

• 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
• A Spectral Bundle Method for Semidefinite Programming

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