Numerical treatment of a class of semi‐infinite programming problems (Q5181566): Difference between revisions

@@ Property / cites work @@
+Asymptotic duality over closed convex sets
@@ Property / cites work: Asymptotic duality over closed convex sets / rank @@
+Normal rank
@@ Property / cites work @@
+On the theory of semi‐infinite programming and a generalization of the kuhn‐tucker saddle point theorem for arbitrary convex functions
+Normal rank
@@ Property / cites work @@
+Q5543516
@@ Property / cites work: Q5543516 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3844775
@@ Property / cites work: Q3844775 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3236244
@@ Property / cites work: Q3236244 / rank @@
+Normal rank
@@ Property / cites work @@
+Formulation of Linear Programs in Analysis. I: Approximation Theory
+Normal rank
@@ Property / cites work @@
+Q3236243
@@ Property / cites work: Q3236243 / rank @@
+Normal rank
@@ Property / cites work @@
+Programmes in Paired Spaces
@@ Property / cites work: Programmes in Paired Spaces / rank @@
+Normal rank
@@ Property / cites work @@
+On the Maximum Errors of Polynomial Approximations Defined by Interpolation and by Least Squares Criteria
+Normal rank
@@ Property / cites work @@
+Q4342463
@@ Property / cites work: Q4342463 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5674306
@@ Property / cites work: Q5674306 / rank @@
+Normal rank