A general correspondence between dual minimax problems and convex programs (Q2528483): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2140/pjm.1968.25.597 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2104874728 / rank | |||
Normal rank | |||
Revision as of 22:17, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A general correspondence between dual minimax problems and convex programs |
scientific article |
Statements
A general correspondence between dual minimax problems and convex programs (English)
0 references
1968
0 references
operations research
0 references
