On complexity of the translational-cut algorithm for convex minimax problems (Q5925720): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:40, 5 March 2024
scientific article; zbMATH DE number 1566506
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
