On Nonconvex Decentralized Gradient Descent
From MaRDI portal
Publication:4622169
DOI10.1109/TSP.2018.2818081zbMath1414.90295arXiv1608.05766OpenAlexW2964026281MaRDI QIDQ4622169
Publication date: 12 February 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.05766
Related Items (16)
A sigmoidal fractional derivative for regularization ⋮ On the Divergence of Decentralized Nonconvex Optimization ⋮ Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints ⋮ Unnamed Item ⋮ A fast proximal gradient algorithm for decentralized composite optimization over directed networks ⋮ Decentralized nonconvex optimization with guaranteed privacy and accuracy ⋮ Decentralized learning over a network with Nyström approximation using SGD ⋮ A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities ⋮ DIMIX: Diminishing Mixing for Sloppy Agents ⋮ A variance-reduced stochastic gradient tracking algorithm for decentralized optimization with orthogonality constraints ⋮ Distributed stochastic gradient tracking methods with momentum acceleration for non-convex optimization ⋮ Second-Order Guarantees of Distributed Gradient Algorithms ⋮ Optimal homotopy asymptotic method-least square for solving nonlinear fractional-order gradient-based dynamic system from an optimization problem ⋮ Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity ⋮ Distributed stochastic nonsmooth nonconvex optimization ⋮ A Global Dual Error Bound and Its Application to the Analysis of Linearly Constrained Nonconvex Optimization
This page was built for publication: On Nonconvex Decentralized Gradient Descent
