Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure

From MaRDI portal
Publication:5245365

DOI10.1137/130915261zbMath1327.90221OpenAlexW2085523940MaRDI QIDQ5245365

Somayeh Sojoudi, Javad Lavaei

Publication date: 8 April 2015

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/b303742839bb6eec8732a18691ce01167188a9dd




Related Items (21)

A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programmingHyperbolic Relaxation of $k$-Locally Positive Semidefinite MatricesExact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programsOn the exactness of a simple relaxation for the extended Celis–Dennis–Tapia subproblemKKT-based primal-dual exactness conditions for the Shor relaxationOn eigenvalues of symmetric matrices with PSD principal submatrices(Global) optimization: historical notes and recent developmentsExact SDP relaxations for quadratic programs with bipartite graph structuresProjectively and Weakly Simultaneously Diagonalizable Matrices and their ApplicationsA graphic structure based branch-and-bound algorithm for complex quadratic optimization and applications to magnitude least-square problemInvariants of SDP exactness in quadratic programmingSubset Selection and the Cone of Factor-Width-k MatricesGraphical models for optimal power flowConvexification of generalized network flow problemTightness of the maximum likelihood semidefinite relaxation for angular synchronizationFinding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex OptimizationA survey on conic relaxations of optimal power flow problemAn Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic ProgramsUnnamed ItemExact SDP relaxations of quadratically constrained quadratic programs with forest structuresSparse PSD approximation of the PSD cone




This page was built for publication: Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure