A numerical method of solving convex problems of optimal control for distributed systems (Q750878)
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 numerical method of solving convex problems of optimal control for distributed systems |
scientific article; zbMATH DE number 4175847
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A numerical method of solving convex problems of optimal control for distributed systems |
scientific article; zbMATH DE number 4175847 |
Statements
A numerical method of solving convex problems of optimal control for distributed systems (English)
0 references
1990
0 references
The authors give a numerical algorithm for the solution of convex optimal control problems for systems governed by linear partial differential equations. The algorithm is based on the method of reduced gradients combined with stochastic generalized gradients. For the inequality constraints an integral penalty function is proposed. A convergence theorem is given.
0 references
methods of moments
0 references
reduced gradients
0 references
stochastic generalized gradients
0 references
integral penalty function
0 references
0.9303613
0 references
0.92738134
0 references
0.9258313
0 references
0.9223677
0 references
