An efficient algorithm for \(\min\)-\(\max\) convex semi-infinite programming problems (Q2829601)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm for - convex semi-infinite programming problems |
scientific article; zbMATH DE number 6648998
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm for \(\min\)-\(\max\) convex semi-infinite programming problems |
scientific article; zbMATH DE number 6648998 |
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
0 references
0 references
0 references
0.8353770971298218
0 references
0.8333252668380737
0 references
0.8229285478591919
0 references
0.8209026455879211
0 references
