On complexity of the translational-cut algorithm for convex minimax problems (Q5925720)
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: On complexity of the translational-cut algorithm for convex minimax problems |
scientific article; zbMATH DE number 1566506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of the translational-cut algorithm for convex minimax problems |
scientific article; zbMATH DE number 1566506 |
Statements
On complexity of the translational-cut algorithm for convex minimax problems (English)
0 references
19 February 2001
0 references
complexity
0 references
minimax optimization
0 references
global Newton method
0 references
interprior-point methods
0 references
analytic centers
0 references
0 references
0.90263844
0 references
0.8959475
0 references
0.8901012
0 references
0 references
0.88641244
0 references
0.88324463
0 references
0 references
