• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Sur le contrôle optimal de systèmes gouvernés par des equations elliptiques

Thumbnail
Date
1972
Dewey
Analyse
Sujet
Calcul optimal; Equations différentielles
Journal issue
Journal of Functional Analysis
Volume
9
Number
1
Publication date
1972
Article pages
1-62
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/0022-1236(72)90013-4
URI
https://basepub.dauphine.fr/handle/123456789/13603
Collections
  • CEREMADE : Publications
Metadata
Show full item record
Author
Ekeland, Ivar
Type
Article accepté pour publication ou publié
Abstract (EN)
This paper is concerned with optimal control problems for distributed-parameter systems over a bounded domain Ω. The state equations are linear partial differential equations of elliptic type, the controls and the cost are distributed over the domain or over its boundary. The controls are bounded and appear in the boundary conditions or in the right-hand member of the state equations.It is easily seen that such problems do usually not admit optimal controls. However, minimizing sequences of controls always exist. For brevity, let us call “optimal state” the state associated with an optimal control, and “minimizing sequence of states” the sequence of states corresponding to a minimizing sequence of controls. Using compacity arguments in Sobolev spaces, it is easily shown that every minimizing sequence of states has cluster points in. The purpose of this paper is to study those cluster points.It is shown that the set of cluster points of all the minimizing sequences of states of a given control problem is the set of optimal states of a new control problem of the same type, called the relaxed problem. This second problem is constructed directly from the first one, by a kind of point-by-point convexification, and it is also proved that both problems have the same value. The proofs rely heavily on convexity arguments. A sufficient condition for the first problem to admit optimal controls is deduced. Finally, two different ways of constructing the relaxed problem are given and are shown to be equivalent to the first one.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.