✦ LIBER ✦

A constrained min-max algorithm for rival models

✍ Scribed by Berc Rustem

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 345 KB
Volume: 12
Category: Article
ISSN: 0165-1889
DOI: 10.1016/0165-1889(88)90021-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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.

Robust min–max portfolio strategies for

Robust min–max portfolio strategies for rival forecast and risk scenarios

✍ Berç Rustem; Robin G. Becker; Wolfgang Marty 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 480 KB

We consider an extension of the Markowitz mean}variance optimization framework to multiple return and risk scenarios. It is well known that asset return forecasts and risk estimates are inherently inaccurate. The method proposed provides a means for considering rival representations of the future. T

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

Quasi-Min-Max MPC algorithms for LPV sys

Quasi-Min-Max MPC algorithms for LPV systems

✍ Yaohui Lu; Yaman Arkun 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 262 KB

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.