Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions

DOI10.1023/A:1025794313696zbMath1043.90060OpenAlexW1606052501MaRDI QIDQ1415482

Publication date: 4 December 2003

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1025794313696

zbMATH Keywords

nonconvex quadratic optimization problem sparsity semidefinite programming relaxation second order cone programming relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20) Methods of successive quadratic programming type (90C55)

Related Items

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems, Efficient solutions of interval programming problems with inexact parameters and second order cone constraints, On the local stability of semidefinite relaxations, Generalized S-lemma and strong duality in nonconvex quadratic programming, Unnamed Item, Unnamed Item, Exact computable representation of some second-order cone constrained quadratic programming problems, Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures, Submodular functions: from discrete to continuous domains, On solving biquadratic optimization via semidefinite relaxation, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, (Global) optimization: historical notes and recent developments, A quasi-linear algorithm for calculating the infimal convolution of convex quadratic functions, A new technique to derive tight convex underestimators (sometimes envelopes), On zero duality gap in nonconvex quadratic programming problems, Exact SDP relaxations for quadratic programs with bipartite graph structures, Invariants of SDP exactness in quadratic programming, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, 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, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, SDP RELAXATIONS FOR QUADRATIC OPTIMIZATION PROBLEMS DERIVED FROM POLYNOMIAL OPTIMIZATION PROBLEMS, Optimization over structured subsets of positive semidefinite matrices via column generation, Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint, Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization, Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, Robust budget allocation via continuous submodular functions, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Polyhedral approximations of the semidefinite cone and their application, Convexity/Nonconvexity Certificates for Power Flow Analysis, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, Exact SDP relaxations of quadratically constrained quadratic programs with forest structures

Uses Software