Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (Q6046826)
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 7734879
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization |
scientific article; zbMATH DE number 7734879 |
Statements
Worst-Case Complexity of TRACE with Inexact Subproblem Solutions for Nonconvex Smooth Optimization (English)
0 references
6 September 2023
0 references
nonlinear optimization
0 references
nonconvex optimization
0 references
worst-case iteration complexity
0 references
worst-case evaluation complexity
0 references
trust-region methods
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8401461839675903
0 references
0.813545823097229
0 references
0.8096017241477966
0 references
0.7708001732826233
0 references
