On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming (Q3225248)
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 6015172
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the evaluation complexity of composite function minimization with applications to nonconvex nonlinear programming |
scientific article; zbMATH DE number 6015172 |
Statements
On the Evaluation Complexity of Composite Function Minimization with Applications to Nonconvex Nonlinear Programming (English)
0 references
16 March 2012
0 references
nonlinear programming
0 references
nonsmooth optimization
0 references
steepest descent methods
0 references
trust region methods
0 references
quadratic regularization methods
0 references
exact penalty methods
0 references
global complexity bounds
0 references
global rate of convergence
0 references
0.8457595705986023
0 references
0.8444973826408386
0 references
0.8215499520301819
0 references
0.8206847310066223
0 references
