2018 Annual American Control Conference (ACC) 2018
DOI: 10.23919/acc.2018.8431231
|View full text |Cite
|
Sign up to set email alerts
|

An integral quadratic constraint framework for real-time steady-state optimization of linear time-invariant systems

Abstract: Achieving optimal steady-state performance in real-time is an increasingly necessary requirement of many critical infrastructure systems. In pursuit of this goal, this paper builds a systematic design framework of feedback controllers for Linear Time-Invariant (LTI) systems that continuously track the optimal solution of some predefined optimization problem. The proposed solution can be logically divided into three components. The first component estimates the system state from the output measurements. The sec… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
26
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 33 publications
(30 citation statements)
references
References 33 publications
2
26
0
Order By: Relevance
“…Dynamical Systems: Given a vector field f : R n ×R → R n , consider the initial value probleṁ Nonlinear Optimization: Given two continuously differentiable functions ξ : R n → R s and ζ : R n → R r , let V := {v ∈ R n | ξ(v) = 0, ζ(v) ≤ 0} and let J(v) := {j | ζ j (v) = 0} denote the set of active inequality constraints at v. We call V a regular set if for all v ∈ V the matrix ∇ξ(v) T ∇ζ J(v) (v) T T has has full row rank s + |J(v)|. 1 The tangent and normal cone of V at v are respectively…”
Section: Preliminariesmentioning
confidence: 99%
See 2 more Smart Citations
“…Dynamical Systems: Given a vector field f : R n ×R → R n , consider the initial value probleṁ Nonlinear Optimization: Given two continuously differentiable functions ξ : R n → R s and ζ : R n → R r , let V := {v ∈ R n | ξ(v) = 0, ζ(v) ≤ 0} and let J(v) := {j | ζ j (v) = 0} denote the set of active inequality constraints at v. We call V a regular set if for all v ∈ V the matrix ∇ξ(v) T ∇ζ J(v) (v) T T has has full row rank s + |J(v)|. 1 The tangent and normal cone of V at v are respectively…”
Section: Preliminariesmentioning
confidence: 99%
“…Note that Assumption II.1 implies that trajectories are complete, i.e., can be extended to t → ∞. 1 The term regular alludes to the fact that these sets are in fact Clarke regular (or tangentially regular) [26]. Furthermore, the requirement that rank ∇ζ J(u) (u) = J(u) is known in the optimization literature as linear independence constraint qualification (LICQ).…”
Section: A Nonlinear Plant Dynamicsmentioning
confidence: 99%
See 1 more Smart Citation
“…The positive definiteness follows from (12) and the definition of isolated maximizer. On the other hand, from (8), it follows that…”
Section: Local Convergence Through Discrete-time Lyapunov Stabilimentioning
confidence: 98%
“…A current trend in optimization, machine learning, and control systems, is that of leveraging on a dynamical systems interpretation of iterative optimization algorithms [6]- [8].…”
Section: Introductionmentioning
confidence: 99%