Related references
Note: Only part of the references are listed.SOLVING THE TRUST-REGION SUBPROBLEM BY A GENERALIZED EIGENVALUE PROBLEM
Satoru Adachi et al.
SIAM JOURNAL ON OPTIMIZATION (2017)
Inexact subgradient methods for quasi-convex optimization problems
Yaohua Hu et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Faster, but weaker, relaxations for quadratically constrained quadratic programs
Samuel Burer et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2014)
Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Lijie Bai et al.
OPTIMIZATION LETTERS (2014)
Nonconvex quadratically constrained quadratic programming: best D.C. decompositions and their SDP representations
X. J. Zheng et al.
JOURNAL OF GLOBAL OPTIMIZATION (2011)
Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
Xiao Jin Zheng et al.
MATHEMATICAL PROGRAMMING (2011)
KKT SOLUTION AND CONIC RELAXATION FOR SOLVING QUADRATICALLY CONSTRAINED QUADRATIC PROGRAMMING PROBLEMS
Cheng Lu et al.
SIAM JOURNAL ON OPTIMIZATION (2011)
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
Franz Rendl et al.
MATHEMATICAL PROGRAMMING (2010)
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
Kurt M. Anstreicher
JOURNAL OF GLOBAL OPTIMIZATION (2009)
On solving nonconvex optimization problems by reducing the duality gap
H Tuy
JOURNAL OF GLOBAL OPTIMIZATION (2005)
On cones of nonnegative quadratic functions
JF Sturm et al.
MATHEMATICS OF OPERATIONS RESEARCH (2003)
A global optimization algorithm using Lagrangian underestimates and the interval Newton method
T Van Voorhis
JOURNAL OF GLOBAL OPTIMIZATION (2002)
Enhancing RLT relaxations via a new class of semidefinite cuts
HD Sherali et al.
JOURNAL OF GLOBAL OPTIMIZATION (2002)
Second order cone programming relaxation of nonconvex quadratic optimization problems
S Kim et al.
OPTIMIZATION METHODS & SOFTWARE (2001)
Dual bounds and optimality cuts for all-quadratic programs with convex constraints
I Nowak
JOURNAL OF GLOBAL OPTIMIZATION (2000)
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
C Audet et al.
MATHEMATICAL PROGRAMMING (2000)
Share Paper
