Convergence properties of trust region methods for linear and convex constraints (Q922951): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: GQTPAR / rank | |||
Normal rank | |||
Revision as of 01:32, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence properties of trust region methods for linear and convex constraints |
scientific article |
Statements
Convergence properties of trust region methods for linear and convex constraints (English)
0 references
1990
0 references
The identification property is crucial for this theory. It is proved first for the projected gradient method and later generalized for the trust region method. Global convergence is established for general convex constraints. For the case of linear constraints the superlinear convergence rate is proved. The mainly geometric convergence theory is based on a sufficient reduction in the trust region subproblem in each iteration.
0 references
sequential quadratic programming
0 references
identification property
0 references
projected gradient method
0 references
trust region method
0 references
Global convergence
0 references
convex constraints
0 references
linear constraints
0 references
superlinear convergence rate
0 references
