Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
From MaRDI portal
Publication:2114577
DOI10.1007/s10898-021-01071-6zbMath1486.90138arXiv2009.02638OpenAlexW3196749966MaRDI QIDQ2114577
Sunyoung Kim, Mituhiro Fukuda, Godai Azuma, Makoto Yamashita
Publication date: 15 March 2022
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.02638
quadratically constrained quadratic programsexact semidefinite relaxationsforest graphrank of aggregated sparsity matrix
Related Items
Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems ⋮ Exact SDP relaxations for quadratic programs with bipartite graph structures ⋮ A graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- On the simultaneous tridiagonalization of two symmetric matrices
- Handbook on semidefinite, conic and polynomial optimization
- Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion
- Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Converse to the Parter--Wiener theorem: the case of non-trees
- A note on a three-term recurrence for a tridiagonal matrix.
- Exploiting sparsity in semidefinite programming via matrix completion. II: Implementation and numerical results
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Eigenvalue-based algorithm and analysis for nonconvex QCQP with one constraint
- On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph
- The generalized trust region subproblem: solution complexity and convex hull results
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- Conic relaxation approaches for equal deployment problems
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues
- Assignment Problems and the Location of Economic Activities
- The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
- Simultaneous tridiagonalization of two symmetric matrices
- Algorithm 996
- Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems
- Polyhedral-based Methods for Mixed-Integer SOCP in Tree Breeding
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
- Quadratically Constrained Quadratic Programs on Acyclic Graphs With Application to Power Flow
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization
- A Survey of the S-Lemma
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
