On the convergence of the proximal algorithm for saddle-point problems (Q4836766): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/02331939508844076
+Normal rank
@@ Property / OpenAlex ID @@
+W2090293948
@@ Property / OpenAlex ID: W2090293948 / rank @@
+Normal rank
@@ Property / cites work @@
+Two general methods for computing saddle points with applications for decomposing convex programming problems
+Normal rank
@@ Property / cites work @@
+Penalty-proximal methods in convex programming
@@ Property / cites work: Penalty-proximal methods in convex programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the Convergence of the Proximal Point Algorithm for Convex Minimization
+Normal rank
@@ Property / cites work @@
+Q3771116
@@ Property / cites work: Q3771116 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4026938
@@ Property / cites work: Q4026938 / rank @@
+Normal rank
@@ Property / cites work @@
+Coupling proximal methods and variational convergence
+Normal rank
@@ Property / cites work @@
+Monotone Operators and the Proximal Point Algorithm
+Normal rank