On nondifferentiable minimax semi-infinite programming problems in complex spaces (Q313722): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C15
@@ Property / Mathematics Subject Classification ID: 90C15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C48
@@ Property / Mathematics Subject Classification ID: 90C48 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K35
@@ Property / Mathematics Subject Classification ID: 49K35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C34
@@ Property / Mathematics Subject Classification ID: 90C34 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C47
@@ Property / Mathematics Subject Classification ID: 90C47 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6626289
@@ Property / zbMATH DE Number: 6626289 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complex minimax programming problem
@@ Property / zbMATH Keywords: complex minimax programming problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+semi-infinite programming
@@ Property / zbMATH Keywords: semi-infinite programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+invexity
@@ Property / zbMATH Keywords: invexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+sufficiency
@@ Property / zbMATH Keywords: sufficiency / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+duality
@@ Property / zbMATH Keywords: duality / rank @@
+Normal rank

Revision as of 01:31, 28 June 2023