Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method (Q1625540)
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: Saddle point criteria for semi-infinite programming problems via an -approximation method |
scientific article; zbMATH DE number 6986564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method |
scientific article; zbMATH DE number 6986564 |
Statements
Saddle point criteria for semi-infinite programming problems via an \(\eta\)-approximation method (English)
0 references
29 November 2018
0 references
semi-infinite programming
0 references
generalized convexity
0 references
optimality conditions
0 references
0.8782359957695007
0 references
0.870773434638977
0 references
0.8503124117851257
0 references
0.8468140959739685
0 references
