A distributed continuous-time method for non-convex QCQPs

Xu Ma; Nicola Elia

doi:10.1016/j.sysconle.2018.09.002

A distributed continuous-time method for non-convex QCQPs

Xu Ma, Nicola Elia

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

This paper studies non-convex Quadratically Constrained Quadratic Programmings (QCQPs) via the continuous-time optimization dynamics. We first develop an easily checkable necessary and sufficient condition that characterizes whether a KKT point will also be a saddle-point (the pair of primal and dual optima) for a non-convex QCQP. Then we analyze the semistability of the saddle-point equilibrium set with respect to the proposed optimization dynamics. We also point out that, for certain networked QCQPs, the proposed approach exhibits an intrinsic distributed computational structure.

Original language	English (US)
Pages (from-to)	16-23
Number of pages	8
Journal	Systems and Control Letters
Volume	121
DOIs	https://doi.org/10.1016/j.sysconle.2018.09.002
State	Published - Nov 2018

Bibliographical note

Funding Information:
This research was supported by the National Science Foundation, grant number CNS-1239319, USA.

Publisher Copyright:
© 2018 Elsevier B.V.

Keywords

Distributed computational structure
Primal–dual optimization dynamics
QCQP
Saddle-point

Publisher link

10.1016/j.sysconle.2018.09.002

Find It

Find It at U of M Libraries

Cite this

@article{2be9f013dda04c91afe3c208812315c6,

title = "A distributed continuous-time method for non-convex QCQPs",

abstract = "This paper studies non-convex Quadratically Constrained Quadratic Programmings (QCQPs) via the continuous-time optimization dynamics. We first develop an easily checkable necessary and sufficient condition that characterizes whether a KKT point will also be a saddle-point (the pair of primal and dual optima) for a non-convex QCQP. Then we analyze the semistability of the saddle-point equilibrium set with respect to the proposed optimization dynamics. We also point out that, for certain networked QCQPs, the proposed approach exhibits an intrinsic distributed computational structure.",

keywords = "Distributed computational structure, Primal–dual optimization dynamics, QCQP, Saddle-point",

author = "Xu Ma and Nicola Elia",

note = "Funding Information: This research was supported by the National Science Foundation, grant number CNS-1239319, USA. Publisher Copyright: {\textcopyright} 2018 Elsevier B.V.",

year = "2018",

month = nov,

doi = "10.1016/j.sysconle.2018.09.002",

language = "English (US)",

volume = "121",

pages = "16--23",

journal = "Systems and Control Letters",

issn = "0167-6911",

publisher = "Elsevier",

}

TY - JOUR

T1 - A distributed continuous-time method for non-convex QCQPs

AU - Ma, Xu

AU - Elia, Nicola

PY - 2018/11

Y1 - 2018/11

N2 - This paper studies non-convex Quadratically Constrained Quadratic Programmings (QCQPs) via the continuous-time optimization dynamics. We first develop an easily checkable necessary and sufficient condition that characterizes whether a KKT point will also be a saddle-point (the pair of primal and dual optima) for a non-convex QCQP. Then we analyze the semistability of the saddle-point equilibrium set with respect to the proposed optimization dynamics. We also point out that, for certain networked QCQPs, the proposed approach exhibits an intrinsic distributed computational structure.

AB - This paper studies non-convex Quadratically Constrained Quadratic Programmings (QCQPs) via the continuous-time optimization dynamics. We first develop an easily checkable necessary and sufficient condition that characterizes whether a KKT point will also be a saddle-point (the pair of primal and dual optima) for a non-convex QCQP. Then we analyze the semistability of the saddle-point equilibrium set with respect to the proposed optimization dynamics. We also point out that, for certain networked QCQPs, the proposed approach exhibits an intrinsic distributed computational structure.

KW - Distributed computational structure

KW - Primal–dual optimization dynamics

KW - QCQP

KW - Saddle-point

UR - http://www.scopus.com/inward/record.url?scp=85054437015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054437015&partnerID=8YFLogxK

U2 - 10.1016/j.sysconle.2018.09.002

DO - 10.1016/j.sysconle.2018.09.002

M3 - Article

AN - SCOPUS:85054437015

VL - 121

SP - 16

EP - 23

JO - Systems and Control Letters

JF - Systems and Control Letters

SN - 0167-6911

ER -

A distributed continuous-time method for non-convex QCQPs

Abstract

Bibliographical note

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this