A Caltech Library Service

Conditions for Exact Convex Relaxation and No Spurious Local Optima

Zhou, Fengyu and Low, Steven H. (2021) Conditions for Exact Convex Relaxation and No Spurious Local Optima. IEEE Transactions on Control of Network Systems . ISSN 2325-5870. doi:10.1109/TCNS.2021.3112758. (In Press)

[img] PDF - Accepted Version
See Usage Policy.

[img] PDF - Submitted Version
See Usage Policy.


Use this Persistent URL to link to this item:


Non-convex optimization problems can be approximately solved via relaxation or local algorithms. For many practical problems such as optimal power flow (OPF) problems, both approaches tend to succeed in the sense that relaxation is usually exact and local algorithms usually converge to a global optimum. In this paper, we study conditions which are sufficient or necessary for such non-convex problems to simultaneously have exact relaxation and no spurious local optima. Those conditions help us explain the widespread empirical experience that local algorithms for OPF problems often work extremely well.

Item Type:Article
Related URLs:
URLURL TypeDescription Paper
Zhou, Fengyu0000-0002-2639-6491
Low, Steven H.0000-0001-6476-3048
Additional Information:© 2021 IEEE.
Subject Keywords:Convex relaxation, local optimum, optimal power flow, semidefinite program
Record Number:CaltechAUTHORS:20210510-075841014
Persistent URL:
Official Citation:F. Zhou and S. Low, "Conditions for Exact Convex Relaxation and No Spurious Local Optima," in IEEE Transactions on Control of Network Systems, doi: 10.1109/TCNS.2021.3112758
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:109018
Deposited By: Tony Diaz
Deposited On:10 May 2021 19:56
Last Modified:14 Dec 2021 21:39

Repository Staff Only: item control page