On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity (Q1723855)
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: On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity |
scientific article; zbMATH DE number 7022157
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity |
scientific article; zbMATH DE number 7022157 |
Statements
On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity (English)
0 references
14 February 2019
0 references
Summary: We are interested in a nonsmooth minimax programming Problem (SIP). Firstly, we establish the necessary optimality conditions theorems for Problem (SIP) when using the well-known Caratheodory's theorem. Under the Lipschitz \((\Phi, \rho)\)-invexity assumptions, we derive the sufficiency of the necessary optimality conditions for the same problem. We also formulate dual and establish weak, strong, and strict converse duality theorems for Problem (SIP) and its dual. These results extend several known results to a wider class of problems.
0 references
nonsmooth semi-infinite minimax programming
0 references
0 references
0 references
