Approximate optimality conditions for minimax programming problems (Q3066917)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5839301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximate optimality conditions for minimax programming problems |
scientific article; zbMATH DE number 5839301 |
Statements
Approximate optimality conditions for minimax programming problems (English)
0 references
20 January 2011
0 references
locally Lipschitz functions
0 references
proximal subdifferentials
0 references
limiting subdifferentials
0 references
Lagrange multipliers
0 references
optimality conditions
0 references
0 references
0 references
0 references
0.8141723275184631
0 references
0.8045253157615662
0 references
0.8019533753395081
0 references
0.8005856275558472
0 references
