A deep cut ellipsoid algorithm for convex programming: Theory and applications (Q1315434): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:57, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A deep cut ellipsoid algorithm for convex programming: Theory and applications |
scientific article |
Statements
A deep cut ellipsoid algorithm for convex programming: Theory and applications (English)
0 references
10 March 1994
0 references
deep cut
0 references
ellipsoid algorithm
0 references
continuous convex programming
0 references
rate of convergence
0 references
min-max stochastic queue location
0 references
