On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions (Q1679617): Difference between revisions

@@ Property / DOI @@
-.1007/s11590-016-1087-4
@@ Property / DOI: 10.1007/s11590-016-1087-4 / rank @@
-Normal rank
@@ Property / cites work @@
+Q3151174
@@ Property / cites work: Q3151174 / rank @@
+Normal rank
@@ Property / cites work @@
+Performance of first-order methods for smooth convex minimization: a novel approach
+Normal rank
@@ Property / cites work @@
+Linear and nonlinear programming.
@@ Property / cites work: Linear and nonlinear programming. / rank @@
+Normal rank
@@ Property / cites work @@
+Q3967358
@@ Property / cites work: Q3967358 / rank @@
+Normal rank
@@ Property / cites work @@
+Introductory lectures on convex optimization. A basic course.
+Normal rank
@@ Property / cites work @@
+Q5491447
@@ Property / cites work: Q5491447 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3491338
@@ Property / cites work: Q3491338 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
+Normal rank
@@ Property / cites work @@
+Smooth strongly convex interpolation and exact worst-case performance of first-order methods
+Normal rank
@@ Property / Wikidata QID @@
+Q59512949
@@ Property / Wikidata QID: Q59512949 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S11590-016-1087-4
@@ Property / DOI: 10.1007/S11590-016-1087-4 / rank @@
+Normal rank