On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity (Q1723855): Difference between revisions
From MaRDI portal
Created a new Item |
Created claim: Wikidata QID (P12): Q59038177, #quickstatements; #temporary_batch_1704699890056 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59038177 / rank | |||
Normal rank | |||
Revision as of 08:49, 8 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On nonsmooth semi-infinite minimax programming problem with \((\Phi, \rho)\)-invexity |
scientific article |
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
