An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601): 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.1080/01630563.2016.1191033 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2407023813 / rank | |||
Normal rank | |||
Revision as of 23:19, 19 March 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
