An interior points algorithm for the convex feasibility problem (Q1166775): Difference between revisions

@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Cyclic subgradient projections
@@ Property / cites work: Cyclic subgradient projections / rank @@
+Normal rank
@@ Property / cites work @@
+Q5520839
@@ Property / cites work: Q5520839 / rank @@
+Normal rank
@@ Property / cites work @@
+Extensions of Hildreth’s Row-Action Method for Quadratic Programming
+Normal rank
@@ Property / cites work @@
+The Relaxation Method for Linear Inequalities
@@ Property / cites work: The Relaxation Method for Linear Inequalities / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
+Normal rank
@@ Property / cites work @@
+Q5553609
@@ Property / cites work: Q5553609 / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank