A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (Q1730832)
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 line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis |
scientific article |
Statements
A line-search algorithm inspired by the adaptive cubic regularization framework and complexity analysis (English)
0 references
6 March 2019
0 references
nonlinear optimization
0 references
unconstrained optimization
0 references
line search methods
0 references
adaptive regularized framework using cubics
0 references
trust-region methods
0 references
worst-case complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7987223863601685
0 references
0.7865679860115051
0 references
0.7860478162765503
0 references
0.7584576606750488
0 references
