Duality for a class of nondifferentiable mathematical programming problems in complex space (Q1079500)
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: Duality for a class of nondifferentiable mathematical programming problems in complex space |
scientific article; zbMATH DE number 3963579
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Duality for a class of nondifferentiable mathematical programming problems in complex space |
scientific article; zbMATH DE number 3963579 |
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
