``Efficient” Subgradient Methods for General Convex Optimization (Q5506689): Difference between revisions

@@ Property / arXiv ID @@
+.08712
@@ Property / arXiv ID: 1605.08712 / rank @@
+Normal rank
@@ Property / cites work @@
+New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure
+Normal rank
@@ Property / cites work @@
+First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
+Normal rank
@@ Property / cites work @@
+Smooth minimization of non-smooth functions
@@ Property / cites work: Smooth minimization of non-smooth functions / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerated first-order methods for hyperbolic programming
+Normal rank
@@ Property / cites work @@
+Convex Analysis
@@ Property / cites work: Convex Analysis / rank @@
+Normal rank