New bounds for nonconvex quadratically constrained quadratic programming
From MaRDI portal
Publication:2689857
DOI10.1007/s10898-022-01224-1OpenAlexW2917463375MaRDI QIDQ2689857
Publication date: 14 March 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.08861
quadratically constrained quadratic programmingsemidefinite relaxationreformulation-linearization technique
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- On standard quadratic optimization problems
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Global optimization approach to unequal global optimization approach to unequal sphere packing problems in 3D
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A new algorithm for concave quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Computable representations for convex hulls of low-dimensional quadratic forms
- Quadratic programming is in NP
- A Mathematical View of Interior-Point Methods in Convex Optimization
- An Introduction to Polynomial and Semi-Algebraic Optimization
- The AMPL Modeling Language: An Aid to Formulating and Solving Optimization Problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- A Survey of the S-Lemma
- Convex analysis and global optimization
This page was built for publication: New bounds for nonconvex quadratically constrained quadratic programming
