On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems (Q3083310)
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: On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems |
scientific article; zbMATH DE number 5868718
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of steepest descent, Newton's and regularized Newton's methods for nonconvex unconstrained optimization problems |
scientific article; zbMATH DE number 5868718 |
Statements
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems (English)
0 references
21 March 2011
0 references
nonlinear optimization
0 references
unconstrained optimization
0 references
steepest-descent method
0 references
Newton's method
0 references
trust-region methods
0 references
cubic regularization
0 references
global complexity bounds
0 references
global rate of convergence
0 references
0.8161827921867371
0 references
0.8125297427177429
0 references
0.8066669702529907
0 references
0.8032013177871704
0 references
