On the complexity of the exchange algorithm for minimax optimization problems (Q3770292): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: On minimax optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Single Facility $l_p $-Distance Minimax Location / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Algorithms for the (Weighted) Minimum Circle Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5630824 / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf02604643 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069154731 / rank | |||
Normal rank | |||
Latest revision as of 09:06, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of the exchange algorithm for minimax optimization problems |
scientific article |
Statements
On the complexity of the exchange algorithm for minimax optimization problems (English)
0 references
1987
0 references
location
0 references
minimax optimization
0 references
convex functions
0 references
