Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity (Q2375696)
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 6175963
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity |
scientific article; zbMATH DE number 6175963 |
Statements
Generalized minimax programming with nondifferentiable \((G, \beta)\)-invexity (English)
0 references
14 June 2013
0 references
Summary: We consider the generalized minimax programming problem (P) in which functions are locally Lipschitz \((G, \beta)\)-invex. Not only \(G\)-sufficient but also \(G\)-necessary optimality conditions are established for problem (P). With \(G\)-necessary optimality conditions and \((G, \beta)\)-invexity on hand, we construct dual problem (DI) for the primal one (P) and prove duality results between problems (P) and (DI). These results extend several known results to a wider class of programs.
0 references
0 references
0 references
0 references
0.9281391501426696
0 references
0.8914496302604675
0 references
0.8887122273445129
0 references
0.8825071454048157
0 references
0.8771003484725952
0 references
