Second-Order Guarantees of Distributed Gradient Algorithms (Q5131964): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 08:32, 30 July 2024

scientific article; zbMATH DE number 7271854

Language	Label	Description	Also known as
English	Second-Order Guarantees of Distributed Gradient Algorithms	scientific article; zbMATH DE number 7271854

Statements

scholarly article

0 references

Second-Order Guarantees of Distributed Gradient Algorithms (English)

0 references

Amir Daneshmand

0 references

Gesualdo Scutari

0 references

Vyacheslav Kungurtsev

0 references

SIAM Journal on Optimization

0 references

publication date

9 November 2020

0 references

full work available at URL

https://arxiv.org/abs/1809.08694

0 references

zbMATH Keywords

distributed gradient methods

0 references

gradient tracking

0 references

nonconvex optimization

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

An Extrinsic Look at the Riemannian Hessian

0 references

Finding approximate local minima faster than gradient descent

0 references

On the convergence of the proximal algorithm for nonsmooth functions involving analytic features

0 references

Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality

0 references

Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods

0 references

0 references

Convergence of a Multi-Agent Projected Stochastic Gradient Algorithm for Non-Convex Optimization

0 references

Gradient Descent Finds the Cubic-Regularized Nonconvex Newton Step

0 references

Accelerated Methods for NonConvex Optimization

0 references

Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results

0 references

Adaptive cubic regularisation methods for unconstrained optimization. II: Worst-case function- and derivative-evaluation complexity

0 references

Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overview

0 references

A trust region algorithm with a worst-case iteration complexity of \(\mathcal{O}(\epsilon ^{-3/2})\) for nonconvex optimization

0 references

Recursive Stochastic Algorithms for Global Optimization in $\mathbb{R}^d $

0 references

Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization

0 references

0 references

On gradients of functions definable in o-minimal structures

0 references

0 references

First-order methods almost always avoid strict saddle points

0 references

Computing a Trust Region Step

0 references

Distributed Optimization Over Time-Varying Directed Graphs

0 references

Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs

0 references

Distributed Subgradient Methods for Multi-Agent Optimization

0 references

Constrained Consensus and Optimization in Multi-Agent Networks

0 references

Introductory lectures on convex optimization. A basic course.

0 references

Cubic regularization of Newton method and its global performance

0 references

Behavior of accelerated gradient methods near critical points of nonconvex functions

0 references

Nonconvergence to unstable points in urn models and stochastic approximations

0 references

On the global convergence of trust region algorithms for unconstrained minimization

0 references

Harnessing Smoothness to Accelerate Distributed Optimization

0 references

Parallel and distributed successive convex approximation methods for big-data optimization

0 references

Distributed nonconvex constrained optimization over time-varying digraphs

0 references

0 references

Non-Convex Distributed Optimization

0 references

On the Convergence of Decentralized Gradient Descent

0 references

On Nonconvex Decentralized Gradient Descent

0 references

An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization

0 references

Identifiers

zbMATH Open document ID

0 references

10.1137/18M121784X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5131964

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5131964&oldid=36899375"