A distributed continuous-time method for non-convex QCQPs

DOI10.1016/j.sysconle.2018.09.002zbMath1408.90225OpenAlexW2895610563WikidataQ129128969 ScholiaQ129128969MaRDI QIDQ1729053

Xu Ma, Nicola Elia

Publication date: 27 February 2019

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2018.09.002

zbMATH Keywords

saddle-pointQCQPdistributed computational structureprimal-dual optimization dynamics

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Uses Software

• PhaseLift

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stability of primal-dual gradient dynamics and applications to network optimization
• A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
• A relaxation method for nonconvex quadratically constrained quadratic programs
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Introduction to Semidefinite, Conic and Polynomial Optimization
• PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
• Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
• Stochastic Perturbation Theory
• Convex Relaxation of Optimal Power Flow—Part I: Formulations and Equivalence

This page was built for publication: A distributed continuous-time method for non-convex QCQPs