Skip to main content
Book Chapter

Semidefinite Programming Relaxations of Nonconvex Quadratic Optimization

  • Nesterov Y
  • Wolkowicz H
  • Ye Y
DOI: 10.1007/978-1-4615-4381-7_13
N/ACitations
Citations of this article
37Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Quadratically constrained quadratic programs, denoted Q2P, are an important modelling tool, e.g.: for hard combinatorial optimization problems, Chapter 12; and SQP methods in nonlinear programming, Chapter 20. These problems are too hard to solve in general....

Cite

CITATION STYLE

APA

Nesterov, Y., Wolkowicz, H., & Ye, Y. (2000). Semidefinite Programming Relaxations of Nonconvex Quadratic Optimization (pp. 361–419). https://doi.org/10.1007/978-1-4615-4381-7_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free