A note on numerical solution of dynamical optimization problems (Q2266571)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on numerical solution of dynamical optimization problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on numerical solution of dynamical optimization problems |
scientific article |
Statements
A note on numerical solution of dynamical optimization problems (English)
0 references
1985
0 references
This note is concerned with optimal control problems governed by evolution partial differential equations in abstract Hilbert spaces. The state and the control are subject to general convex constraints. The problem is approximated first by the penalty function technique of \textit{A. V. Balakrishnan} [SIAM J. Control 6, 149-173 (1968; Zbl 0174.408)]. Next every penalized problem is treated by a technique of approximation (in Banach spaces) due to \textit{S. De Julio} [ibid. 8, 135-147 (1970; Zbl 0223.49036)]. Convergence theorems are formulated. The results of this note extend those of Julio to the case of more general constraints.
0 references
optimal control
0 references
evolution equations
0 references
abstract Hilbert spaces
0 references
convex constraints
0 references
penalty function technique
0 references
Convergence
0 references