Duality for a class of nondifferentiable mathematical programming problems in complex space (Q1079500): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q217469 |
Changed an Item |
||
| Property / reviewed by | |||
| Property / reviewed by: Bruce D.Craven / rank | |||
Normal rank | |||
Revision as of 04:28, 11 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality for a class of nondifferentiable mathematical programming problems in complex space |
scientific article |
Statements
Duality for a class of nondifferentiable mathematical programming problems in complex space (English)
0 references
1984
0 references
A minimax problem in complex spaces is considered, to minimize \(\sup_{\eta \in W} re\phi(\zeta,\eta)\) subject to a constraint \(- g(\zeta)\in S\). Lagrangian conditions necessary, or sufficient, for a minimax are obtained. Duality and converse duality theorems are obtained, under convex hypotheses. These results generalize results of Schmitendorf and Tanimoto for real spaces.
0 references
nondifferentiable programming
0 references
minimax problem in complex spaces
0 references
Lagrangian conditions
0 references
converse duality
0 references
