Relaxation methods for problems with strictly convex separable costs and linear constraints (Q3777809): Difference between revisions

@@ Property / cites work @@
+Distributed Asynchronous Relaxation Methods for Convex Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Relaxation Methods for Network Flow Problems with Convex Arc Costs
+Normal rank
@@ Property / cites work @@
+Relaxation Methods for Linear Programs
@@ Property / cites work: Relaxation Methods for Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+On the convergence of a block successive over-relaxation method for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q3721676
@@ Property / cites work: Q3721676 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3688092
@@ Property / cites work: Q3688092 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5672476
@@ Property / cites work: Q5672476 / rank @@
+Normal rank
@@ Property / cites work @@
+On search directions for minimization algorithms
@@ Property / cites work: On search directions for minimization algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Q3730336
@@ Property / cites work: Q3730336 / rank @@
+Normal rank
@@ Property / cites work @@
+On the convergence of sequential minimization algorithms
+Normal rank
@@ Property / cites work @@
+Note—A Note on the Cyclic Coordinate Ascent Method
+Normal rank