On complexity of the translational-cut algorithm for convex minimax problems (Q5925720): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1026422013954 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1795420581 / rank | |||
Normal rank | |||
Latest revision as of 09:56, 30 July 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
