Global convergence of the partitioned BFGS algorithm for convex partially separable optimization (Q3030592)
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 4018788
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Global convergence of the partitioned BFGS algorithm for convex partially separable optimization |
scientific article; zbMATH DE number 4018788 |
Statements
Global convergence of the partitioned BFGS algorithm for convex partially separable optimization (English)
0 references
1986
0 references
unconstrained optimization
0 references
large scale problems
0 references
global convergence
0 references
partitioned updating algorithm
0 references
0.8935948014259338
0 references
0.8884484767913818
0 references
0.7983080744743347
0 references
0.7892720699310303
0 references
To overcome the difficulty of the Broyden-Fletcher-Goldfarb-Shanno method with large scale problems, Griewank and Toint have earlier proposed ``partitioned updating'' algorithms which exploit the fact that in many such problems the objective function has the form \(f(x)=\sum^{m}_{i=1}f_ i(x)\), where each function \(f_ i\) only depends on a few components of x. In the reviewed paper the author presents a proof of the global convergence for a partitioned updating algorithm when each \(f_ i\) is convex (and some additional conditions are fulfilled). Inexact solution of the linear system defining the search direction and variants of the steplength rule are also shown to be acceptable without affecting the global convergence properties.
0 references