✦ LIBER ✦

Quasi-Min-Max MPC algorithms for LPV systems

✍ Scribed by Yaohui Lu; Yaman Arkun

Publisher: Elsevier Science
Year: 2000
Tongue: English
Weight: 262 KB
Volume: 36
Category: Article
ISSN: 0005-1098
DOI: 10.1016/s0005-1098(99)00176-4

No coin nor oath required. For personal study only.

✦ Synopsis

A scheduling model predictive controller is presented for polytopic linear parameter varying systems with input and output constraints. It is shown that the receding horizon implementation of the feasible solutions guarantees closed-loop stability.

📜 SIMILAR VOLUMES

Approximation Algorithms for Min–Max Tre

Approximation Algorithms for Min–Max Tree Partition

✍ Nili Guttmann-Beck; Refael Hassin 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 298 KB

We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP.

A constrained min-max algorithm for riva

A constrained min-max algorithm for rival models

✍ Berc Rustem 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 345 KB

An efficient computational algorithm for

An efficient computational algorithm for min-max operations

✍ Zhang Xinghu; Shaohua Tan; Hang Chang-Chieh; Wang Pei-Zhuang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A min-max algorithm for non-linear regre

A min-max algorithm for non-linear regression models

✍ A. Tishler; I. Zang 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 845 KB

A superlinearly convergent constrained m

A superlinearly convergent constrained min-max algorithm for rival models of the same system

✍ B. Rustem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 729 KB

In the presence of rival models of the same economic system, an optimal policy can be computed that takes account of the existence of all the models. A min-max, worst-case design, problem is formulated and subsequently restated as an alternative min-max problem. A numerical example of this approach

The general trapezoidal algorithm for st

The general trapezoidal algorithm for strongly regular max–min matrices

✍ Martin Gavalec 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The problem of the strong regularity for square matrices over a general max-min algebra is considered. An O(n 2 log n) algorithm for recognition of the strong regularity of a given n × n matrix is proposed. The algorithm works without any restrictions on the underlying max-min algebra, concerning th