An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:49, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems |
scientific article |
Statements
An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (English)
0 references
8 November 2016
0 references
convex programming
0 references
exchange method
0 references
semi-infinite programming
0 references
