Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs
From MaRDI portal
Cites work
- A Copositive Programming Approach to Graph Partitioning
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- A Newton-bracketing method for a simple conic optimization problem
- A survey for the quadratic assignment problem
- Algorithm 996
- An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
- Approximation of the stability number of a graph via copositive programming
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Dual quadratic estimates in polynomial and Boolean programming
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Exact SDP relaxations for quadratic programs with bipartite graph structures
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
- Genericity results in linear conic programming -- a tour d'horizon
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems
- Nonlinear Programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- On the tightness of SDP relaxations of QCQPs
- Quadratic maximization and semidefinite relaxation
- SDP relaxations for quadratic optimization problems derived from polynomial optimization problems
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Strong duality of a conic optimization problem with a single hyperplane and two cone constraints
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
This page was built for publication: Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7011951)
