Dynamic optimization problems with bounded terminal conditions (Q1075254): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal landing of a helicopter in autorotation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sequential gradient-restoration algorithm for optimal control problems with nondifferential constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5593460 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:54, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dynamic optimization problems with bounded terminal conditions |
scientific article |
Statements
Dynamic optimization problems with bounded terminal conditions (English)
0 references
1987
0 references
Bounded terminal conditions of nonlinear optimization problems are converted to equality terminal conditions via the Valentine's device. In so doing, additional unknown parameters are introduced into the problem. The transformed problems can still be easily solved using the sequential gradient-restoration algorithm via a simple augmentation of the unknown parameter vector \(\pi\). Three example problems with bounded terminal conditions are solved to verify this technique.
0 references
Valentine's device
0 references
bounded terminal conditions
0 references
nonlinear optimization
0 references
equality terminal conditions
0 references
transformed problems
0 references
sequential gradient restoration algorithm
0 references
0 references
