A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
From MaRDI portal
Publication:5038154
DOI10.1080/02331934.2020.1865347zbMath1501.90064OpenAlexW3114729515MaRDI QIDQ5038154
Jing Zhou, Siying Yu, Ye Tian, Sheng-Hong Chen
Publication date: 29 September 2022
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2020.1865347
branch-and-bound algorithmquadratically constrained quadratic programsimultaneous diagonalizationquadratic convex reformulation
Related Items (2)
Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications ⋮ A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint
Uses Software
Cites Work
- Unnamed Item
- Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- An SOCP relaxation based branch-and-bound method for generalized trust-region subproblem
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- A simultaneous diagonalization based SOCP relaxation for convex quadratic programs with linear complementarity constraints
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem
- Hidden conic quadratic representation of some nonconvex quadratic optimization problems
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
- Lectures on Modern Convex Optimization
- Simultaneous Diagonalization of Matrices and Its Applications in Quadratically Constrained Quadratic Programming
- A new trust region method for nonsmooth nonconvex optimization
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Global solution of non-convex quadratically constrained quadratic programs
This page was built for publication: A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
