Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
DOI10.1137/130915261zbMath1327.90221OpenAlexW2085523940MaRDI QIDQ5245365
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
global optimizationconvex optimizationpower systemssemidefinite programmingnonlinear optimizationgraph theoryconvex relaxationsecond-order cone programmingquadratically constrained quadratic programsoptimal power flowcomplex optimizationgeneralized weighted graph
Programming involving graphs or networks (90C35) Semidefinite programming (90C22) Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Convex functions and convex programs in convex geometry (52A41)
Related Items (21)
This page was built for publication: Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure