Pages that link to "Item:Q2311123"
From MaRDI portal
The following pages link to Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123):
Displaying 21 items.
- An adaptive accelerated first-order method for convex optimization (Q276852) (← links)
- Fast first-order methods for composite convex optimization with backtracking (Q404292) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach (Q2031939) (← links)
- Fast and safe: accelerated gradient methods with optimality certificates and underestimate sequences (Q2044479) (← links)
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization (Q2044495) (← links)
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization (Q2046565) (← links)
- Generalized Nesterov's accelerated proximal gradient algorithms with convergence rate of order \(o(1/k^2)\) (Q2082553) (← links)
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives (Q2165600) (← links)
- An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization (Q2352420) (← links)
- Superfast second-order methods for unconstrained convex optimization (Q2664892) (← links)
- Fast gradient methods for uniformly convex and weakly smooth problems (Q2673504) (← links)
- Robustness of Accelerated First-Order Algorithms for Strongly Convex Optimization Problems (Q5002058) (← links)
- Inexact proximal stochastic second-order methods for nonconvex composite optimization (Q5135256) (← links)
- First-order Methods for the Impatient: Support Identification in Finite Time with Convergent Frank--Wolfe Variants (Q5233104) (← links)
- A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
- Fast convex optimization via a third-order in time evolution equation (Q5864709) (← links)
- Accelerated First-Order Methods for Convex Optimization with Locally Lipschitz Continuous Gradient (Q6046830) (← links)
- First-order methods for convex optimization (Q6169988) (← links)
- High-order methods beyond the classical complexity bounds: inexact high-order proximal-point methods (Q6634529) (← links)
