Accelerated Optimization for Machine Learning

DOI10.1007/978-981-15-2910-8zbMath1434.68008OpenAlexW4240391021MaRDI QIDQ4961128

Zhouchen Lin, Cong Fang, Hu-An Li

Publication date: 21 April 2020

Full work available at URL: https://doi.org/10.1007/978-981-15-2910-8

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (20)

Accelerated proximal gradient method for bi-modulus static elasticity ⋮ A new accelerated positive-indefinite proximal ADMM for constrained separable convex optimization problems ⋮ Faster Lagrangian-Based Methods in Convex Optimization ⋮ Two-level optimization approach with accelerated proximal gradient for objective measures in sparse speech reconstruction ⋮ Accelerated differential inclusion for convex optimization ⋮ Inertial primal-dual dynamics with damping and scaling for linearly constrained convex optimization problems ⋮ Inertial projected gradient method for large-scale topology optimization ⋮ Fast gradient method for low-rank matrix estimation ⋮ Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm ⋮ Quasi-static frictional contact analysis free from solutions of linear equations: an approach based on primal-dual algorithm ⋮ Decentralized saddle-point problems with different constants of strong convexity and strong concavity ⋮ Accelerated doubly stochastic gradient descent for tensor CP decomposition ⋮ Time rescaling of a primal-dual dynamical system with asymptotically vanishing damping ⋮ A second order primal-dual dynamical system for a convex-concave bilinear saddle point problem ⋮ Accelerated stochastic variance reduction for a class of convex optimization problems ⋮ Improved convergence rates and trajectory convergence for primal-dual dynamical systems with vanishing damping ⋮ Proximal gradient method for nonconvex and nonsmooth optimization on Hadamard manifolds ⋮ From differential equation solvers to accelerated first-order methods for convex optimization ⋮ Fast primal-dual algorithm via dynamical system for a linearly constrained convex optimization problem ⋮ Inertial accelerated SGD algorithms for solving large-scale lower-rank tensor CP decomposition problems

This page was built for publication: Accelerated Optimization for Machine Learning