Volume 34, Number 2, March/April 2000Special issue for R. Teman's 60th birthday
|Page(s)||409 - 418|
|Published online||15 April 2002|
Least regret control, virtual control and decomposition methods
Collège de France, 3 rue d'Ulm, 75231
Paris Cedex 05, France.
"Least regret control" consists in trying to find a control which "optimizes the situation" with the constraint of not making things too worse with respect to a known reference control, in presence of more or less significant perturbations. This notion was introduced in . It is recalled on a simple example (an elliptic system, with distributed control and boundary perturbation) in Section 2. We show that the problem reduces to a standard optimal control problem for augmented state equations. On another hand, we have introduced in recent notes [9-12] the method of virtual control, aimed at the "decomposition of everything" (decomposition of the domain, of the operator, etc). An introduction to this method is presented, without a priori knowledge needed, in Sections 3 and 4, directly on the augmented state equations. For problems without control, or with "standard" control, numerical applications of the virtual control ideas have been given in the notes [9-12] and in the note . One of the first systematic paper devoted to all kind of decomposition methods, including multicriteria, is a joint paper with A. Bensoussan and R. Temam, to whom this paper is dedicated, cf. .
Mathematics Subject Classification: 49A22 / 35J99
Key words: Control / least regret / domain decomposition / virtuel control.
© EDP Sciences, SMAI, 2000
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.