A simple constraint qualification in infinite dimensional programming (Q3731366): Difference between revisions

@@ Property / cites work @@
+Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
+Normal rank
@@ Property / cites work @@
+Q3902815
@@ Property / cites work: Q3902815 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3923971
@@ Property / cites work: Q3923971 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizations of optimality without constraint qualification for the abstract convex program
+Normal rank
@@ Property / cites work @@
+Generalizations of Farkas’ Theorem
@@ Property / cites work: Generalizations of Farkas’ Theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4104377
@@ Property / cites work: Q4104377 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Programming in Reflexive Spaces
@@ Property / cites work: Linear Programming in Reflexive Spaces / rank @@
+Normal rank
@@ Property / cites work @@
+Constrained \(L_ p\) approximation
@@ Property / cites work: Constrained \(L_ p\) approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Some applications of optimization in matrix theory
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01589443
+Normal rank
@@ Property / OpenAlex ID @@
+W1999138341
@@ Property / OpenAlex ID: W1999138341 / rank @@
+Normal rank