Rounding of convex sets and efficient gradient methods for linear programming problems (Q5459820)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Rounding of convex sets and efficient gradient methods for linear programming problems |
scientific article; zbMATH DE number 5270209
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0 references
0 references
0.7701216340065002
0 references
0.7476445436477661
0 references
0.7433866262435913
0 references
0.7399117350578308
0 references
