Background results for robust minmax control of linear dynamical systems
The purpose of this note is to summarize the arguments required to derive the results appearing in robust minmax control of linear dynamical systems using a quadratic stage cost. The main result required in robust minmax control is Proposition 20.a. Moreover, the solution to the trust-region problem given in Proposition 15 and Lemma 16 may be of more general interest. This revised (second) version provides the following corrections and extensions of the previous (first) version. 1. The optimal u and w formulas in the original Corollary 13, Proposition 14, Corollary 19, and Proposition 20 have been corrected in this revision. 2. Corollary 13 and Proposition 14 are combined in the revised Proposition 14.a. 3. Corollary 19 and Proposition 20 are combined in the revised Proposition 20.a. 4. The revised Proposition 12.a is a generalization of the previous Proposition 12. 5. Propositions 5.a, 5.b, and 5.c are new in this revision. 6. Figure 1 has been revised to illustrate the revised Proposition 14.a.
Code (0)
등록된 구현이 없습니다.
Tasks
LEMMASimilar Papers 제목 키워드 기반
Data-driven learning of feedback maps for explicit robust predictive control: an approximation theoretic view
We establish an algorithm to learn feedback maps from data for a class of robust model predictive control (MPC) problems. The algorithm accounts for the approximation errors due to the learning directly at the synthesis …
MinMax Recurrent Neural Cascades
We introduce MinMax Recurrent Neural Cascades (MinMax RNCs), a class of recurrent neural networks built from a novel form of recurrence over the MinMax algebra. We show that MinMax RNCs enjoy key properties that are diff…
Smooth $\%$MinMax: A Differentiable Relaxation for Codon Harmonization
Codon harmonization aims to adapt the coding sequences for heterologous expression while preserving the native-like patterns of frequent and rare codons that may influence local translation dynamics and co-translational …
MinMax Networks
While much progress has been achieved over the last decades in neuro-inspired machine learning, there are still fundamental theoretical problems in gradient-based learning using combinations of neurons. These problems, s…
A Biased Estimator for MinMax Sampling and Distributed Aggregation
MinMax sampling is a technique for downsampling a real-valued vector which minimizes the maximum variance over all vector components. This approach is useful for reducing the amount of data that must be sent over a const…