Superlinear convergence of a trust region type successive linear programming method (Q1102881)
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: Superlinear convergence of a trust region type successive linear programming method |
scientific article; zbMATH DE number 4051396
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Superlinear convergence of a trust region type successive linear programming method |
scientific article; zbMATH DE number 4051396 |
Statements
Superlinear convergence of a trust region type successive linear programming method (English)
0 references
1989
0 references
The convergence rate of the SLP method suggested by the author, \textit{N.- H. Kim} and \textit{L. Lasdon} [Manage. Sci. 31, 1312-1331 (1985; Zbl 0601.90128)] is discussed for composite nondifferentiable optimization problems. A superlinear rate is assured under a growth condition, and it is further strengthened to a quadratic rate if the inside function is twice differentiable. Several sufficient conditions are given which make the growth condition true. These conditions can be relaxed considerably in practical use.
0 references
successive linear programming
0 references
composite nondifferentiable optimization
0 references
growth condition
0 references
nonsmooth optimization
0 references
trust region
0 references
superlinear convergence
0 references
bang-bang control
0 references
0 references
0 references
0 references
0 references
0.93889964
0 references
0.9330626
0 references
0.9194316
0 references
0.9169391
0 references
0.9165356
0 references
