A projective quasi-Newton method for nonlinear optimization (Q1344341)
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 projective quasi-Newton method for nonlinear optimization |
scientific article; zbMATH DE number 721010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A projective quasi-Newton method for nonlinear optimization |
scientific article; zbMATH DE number 721010 |
Statements
A projective quasi-Newton method for nonlinear optimization (English)
0 references
9 February 1995
0 references
A trust region method for nonlinear optimization problems with equality constraints is proposed. This method incorporates quadratic subproblems in which orthogonal projective matrices of the Jacobian of constraint functions are used to replace OR decompositions. It is proved that all accumulation points of iterates are Karush-Kuhn-Tucker points and that the method has a one-step superlinear convergence rate.
0 references
projective quasi-Newton method
0 references
trust region method
0 references
nonlinear optimization
0 references
OR decompositions
0 references
Karush-Kuhn-Tucker points
0 references
superlinear convergence
0 references
0.8807642459869385
0 references
0.8630635738372803
0 references
0.8540969491004944
0 references
0.8459387421607971
0 references
0.8407286405563354
0 references
