2016
DOI: 10.1016/j.sysconle.2015.11.006
|View full text |Cite
|
Sign up to set email alerts
|

Stability of an analog optimization circuit for quadratic programming

Abstract: We study the stability of an analog optimization circuit that solves quadratic programming (QP) problems. The circuit dynamics are modeled as a switched affine system. A piece-wise quadratic Lyapunov function and the KYP lemma are used to derive the stability criterion. The stability criterion characterizes the range of critical circuit parameters for which the QP circuit is globally exponentially stable.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 19 publications
(1 citation statement)
references
References 12 publications
(21 reference statements)
0
1
0
Order By: Relevance
“…To tackle these problems, advanced optimization methods shed light on developing computer-aided design (CAD) tools to find solutions for demanding specifications and trade-offs [4]. The design process must be more productive, cost-effective, and error-free to achieve reliability and stability [5].…”
Section: Introductionmentioning
confidence: 99%
“…To tackle these problems, advanced optimization methods shed light on developing computer-aided design (CAD) tools to find solutions for demanding specifications and trade-offs [4]. The design process must be more productive, cost-effective, and error-free to achieve reliability and stability [5].…”
Section: Introductionmentioning
confidence: 99%