Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820): 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.1080/10556780701550059 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2111208481 / rank | |||
Normal rank | |||
Revision as of 19:05, 19 March 2024
scientific article; zbMATH DE number 5270209
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rounding of convex sets and efficient gradient methods for linear programming problems |
scientific article; zbMATH DE number 5270209 |
Statements
Rounding of convex sets and efficient gradient methods for linear programming problems (English)
0 references
29 April 2008
0 references
nonlinear optimization
0 references
convex optimization
0 references
complexity bounds
0 references
relative accuracy
0 references
fully polynomial approximation schemes
0 references
gradient methods
0 references
optimal methods
0 references
