A tilted cutting plane proximal bundle method for convex nondifferentiable optimization (Q2638937): Difference between revisions

@@ Property / cites work @@
+Q3807888
@@ Property / cites work: Q3807888 / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q3738946
@@ Property / cites work: Q3738946 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
+Normal rank
@@ Property / cites work @@
+Proximity control in bundle methods for convex nondifferentiable minimization
+Normal rank
@@ Property / cites work @@
+Q4733677
@@ Property / cites work: Q4733677 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4182270
@@ Property / cites work: Q4182270 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4040780
@@ Property / cites work: Q4040780 / rank @@
+Normal rank
@@ Property / cites work @@
+A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
+Normal rank
@@ Property / cites work @@
+Boundary Behavior of Interior Point Algorithms in Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4733672
@@ Property / cites work: Q4733672 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3718489
@@ Property / cites work: Q3718489 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0167-6377(91)90090-c
+Normal rank
@@ Property / OpenAlex ID @@
+W2078123844
@@ Property / OpenAlex ID: W2078123844 / rank @@
+Normal rank