A super-linear convergent gradient projection type algorithm for linearly constrained problems (Q761975)
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 3889286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A super-linear convergent gradient projection type algorithm for linearly constrained problems |
scientific article; zbMATH DE number 3889286 |
Statements
A super-linear convergent gradient projection type algorithm for linearly constrained problems (English)
0 references
1984
0 references
By combining the Davidon-Fletcher-Powell variable metric method with an algorithm using only one gradient projection matrix at each iteration, the author gives a superlinear convergent method for solving linearly constrained problems with convex objective functions.
0 references
linear constraints
0 references
superlinear convergence
0 references
variable metric method
0 references
gradient projection
0 references
convex objective functions
0 references
0.8590285778045654
0 references
