Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

Sunyoung Kim,Masakazu Kojima

doi:10.1023/a:1025794313696

Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations

Sunyoung Kim, Masakazu Kojima

https://doi.org/10.1023/a:1025794313696

Copy DOI

Journal: Computational Optimization and Applications	Publication Date: Jan 1, 2003
Citations: 169

Affiliation: Baewha Women's University, Tokyo Institute of Technology

#Second Order Cone Programming Relaxations #Second Order Cone Programming + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We show that SDP (semidefinite programming) and SOCP (second order cone programming) relaxations provide exact optimal solutions for a class of nonconvex quadratic optimization problems. It is a ge...

Full Text

Paper version not known

Open DOI Link

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Similar Papers

Paper Title

Journal

Date

Author

View more papers

More From: Computational Optimization and Applications

Paper Title

Journal

Date

Author

View more papers

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.