Semidefinite programming relaxation for nonconvex quadratic programs
From MaRDI portal
Publication:1361074
DOI10.1023/A:1008282830093zbMath0881.90101OpenAlexW2020562473MaRDI QIDQ1361074
Tetsuya Fujie, Kojima, Masakazu
Publication date: 23 July 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008282830093
semidefinite programminginterior-point methodlinear matrix inequalityrelaxation methodnonconvex quadratic programquadratic inequality constraints
Related Items (40)
On Convex Hulls of Epigraphs of QCQPs ⋮ On the tightness of SDP relaxations of QCQPs ⋮ Causal state-feedback parameterizations in robust model predictive control ⋮ Generating cutting planes for the semidefinite relaxation of quadratic programs ⋮ Generalized S-lemma and strong duality in nonconvex quadratic programming ⋮ Extra resource allocation: a DEA approach in the view of efficiencies ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms ⋮ Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms ⋮ On zero duality gap in nonconvex quadratic programming problems ⋮ Invariants of SDP exactness in quadratic programming ⋮ Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization ⋮ Unbounded convex sets for non-convex mixed-integer quadratic programming ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations ⋮ Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints ⋮ A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs ⋮ A note on representations of linear inequalities in non-convex mixed-integer quadratic programs ⋮ A guide to conic optimisation and its applications ⋮ Consistency Analysis for Massively Inconsistent Datasets in Bound-to-Bound Data Collaboration ⋮ Semidefinite relaxation for the total least squares problem with Tikhonov-like regularization ⋮ A New Approach to the Stable Set Problem Based on Ellipsoids ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ A projected gradient algorithm for solving the maxcut SDP relaxation ⋮ Second order cone programming relaxation of nonconvex quadratic optimization problems ⋮ On the problem of packing spheres in a cube ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ Intersection cuts for nonlinear integer programming: convexification techniques for structured sets ⋮ Exact dual bounds for some nonconvex minimax quadratic optimization problems ⋮ Faster, but weaker, relaxations for quadratically constrained quadratic programs ⋮ Interpolant Synthesis for Quadratic Polynomial Inequalities and Combination with EUF ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems ⋮ A novel approach for solving semidefinite programs ⋮ On the finite convergence of successive SDP relaxation methods ⋮ On the Slater condition for the SDP relaxations of nonconvex sets
This page was built for publication: Semidefinite programming relaxation for nonconvex quadratic programs
