One method of solving the convex programming problem (Q3921002): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q1161985 |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: B. N. Pshenichnyĭ / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiplier and gradient methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01069607 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080453030 / rank | |||
Normal rank | |||
Latest revision as of 10:02, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | One method of solving the convex programming problem |
scientific article |
Statements
One method of solving the convex programming problem (English)
0 references
1980
0 references
Lagrangian
0 references
superlinear convergence
0 references
rate of convergence
0 references
convergence acceleration technique
0 references
