A super-linear convergent gradient projection type algorithm for linearly constrained problems (Q761975): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(84)90288-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079733897 / rank | |||
Normal rank | |||
Revision as of 20:23, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A super-linear convergent gradient projection type algorithm for linearly constrained problems |
scientific article |
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
