Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm (Q4702342): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 18:00, 5 March 2024
scientific article; zbMATH DE number 1368669
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm |
scientific article; zbMATH DE number 1368669 |
Statements
Condition-Based Complexity of Convex Optimization in Conic Linear Form via the Ellipsoid Algorithm (English)
0 references
24 November 1999
0 references
complexity of convex optimization
0 references
ellipsoid method
0 references
conditioning
0 references
error analysis
0 references
