Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
From MaRDI portal
Publication:2188238
DOI10.1007/s10107-019-01367-2zbMath1445.90073arXiv1802.02688OpenAlexW2963227682WikidataQ128448972 ScholiaQ128448972MaRDI QIDQ2188238
Publication date: 10 June 2020
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.02688
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
On Convex Hulls of Epigraphs of QCQPs, On the tightness of SDP relaxations of QCQPs, Finite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a Graph, On Obtaining the Convex Hull of Quadratic Inequalities via Aggregations, Cutting Plane Generation through Sparse Principal Component Analysis, The equivalence of optimal perspective formulation and Shor's SDP for quadratic programs with indicator variables, On indefinite quadratic optimization over the intersection of balls and linear constraints, On the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblem, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, KKT-based primal-dual exactness conditions for the Shor relaxation, (Global) optimization: historical notes and recent developments, Convex hull results on quadratic programs with non-intersecting constraints, Aggregations of Quadratic Inequalities and Hidden Hyperplane Convexity, An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization, Exact SDP relaxations for quadratic programs with bipartite graph structures, Projectively and Weakly Simultaneously Diagonalizable Matrices and their Applications, Invariants of SDP exactness in quadratic programming, On sparsity of the solution to a random quadratic optimization problem, Correction to: ``Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Handbook on semidefinite, conic and polynomial optimization
- Problems of distance geometry and convex properties of quadratic maps
- Semidefinite programming relaxation for nonconvex quadratic programs
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Approximating quadratic programming with bound and quadratic constraints
- Quadratic programs with hollows
- A branch and bound algorithm for nonconvex quadratic optimization with ball and linear constraints
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- A gentle, geometric introduction to copositive optimization
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- Conditions for Correct Sensor Network Localization Using SDP Relaxation
- On the average number of steps of the simplex method of linear programming
- Semidefinite optimization
- Smoothed analysis of algorithms
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
- Toward Probabilistic Analysis of Interior-Point Algorithms for Linear Programming
- New Results on Quadratic Minimization
- Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Polynomial Solvability of Variants of the Trust-Region Subproblem
- On Cones of Nonnegative Quadratic Functions
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- Geometry of cuts and metrics
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
