Numerical approximation of nonconvex optimal control problems defined by parabolic equations (Q791140): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5667133 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Steepest Descent with Relaxed Controls / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An exact penalty function algorithm for optimal control problems with control and terminal equality constraints. I / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimization of Functionals in Normed Spaces / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5601627 / rank | |||
Normal rank |
Latest revision as of 11:19, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numerical approximation of nonconvex optimal control problems defined by parabolic equations |
scientific article |
Statements
Numerical approximation of nonconvex optimal control problems defined by parabolic equations (English)
0 references
1985
0 references
We consider an optimal control problem for distributed systems governed by parabolic equations. The state equations are nonlinear in the control variable; the constraints and the cost functional are generally nonconvex. Relaxed controls are used to prove existence and derive necessary conditions for optimality. To compute optimal controls, a descent method is applied to the resulting relaxed problem. A numerical method is also given for approximating a special class of relaxed controls, notably those obtaind by the descent method. Convergence proofs are given for both methods, and a numerical example is provided.
0 references
nonconvexity
0 references
relaxed minimum principle
0 references
descent method
0 references
relaxed controls
0 references
Convergence
0 references
0 references