Convergence of DFP algorithms without convexity and exact line search assumptions (Q2860081)
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 6230457
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence of DFP algorithms without convexity and exact line search assumptions |
scientific article; zbMATH DE number 6230457 |
Statements
19 November 2013
0 references
Broyden algorithms
0 references
convergence
0 references
convexity
0 references
inexact line search
0 references
Convergence of DFP algorithms without convexity and exact line search assumptions (English)
0 references
0.9052923321723938
0 references
0.8798078894615173
0 references
0.8525606393814087
0 references
