A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization (Q517288)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6696628
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization |
scientific article; zbMATH DE number 6696628 |
Statements
A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization (English)
0 references
23 March 2017
0 references
unconstrained optimization
0 references
nonlinear optimization
0 references
nonconvex optimization
0 references
trust region methods
0 references
global convergence
0 references
local convergence
0 references
worst-case iteration complexity
0 references
worst-case evaluation complexity
0 references
0.8522357940673828
0 references
0.8496994972229004
0 references
0.8401461839675903
0 references
0.8307315707206726
0 references
