On the Rate of Convergence of a Partially Asynchronous Gradient Projection Algorithm

DOI10.1137/0801036zbMath0754.90055OpenAlexW2061689074MaRDI QIDQ4012438

Paul Tseng

Publication date: 27 September 1992

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0801036

zbMATH Keywords

rate of convergencegradient projection algorithmlocally upper Lipschitzian multifunctionpartially asynchronous implementation

Mathematics Subject Classification ID

Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Globally convergent block-coordinate techniques for unconstrained optimization, Convergence rate analysis of an asynchronous space decomposition method for convex Minimization, Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays, On the rate of convergence of projected Barzilai–Borwein methods, Error bounds in mathematical programming, On unbounded delays in asynchronous parallel fixed-point algorithms, On Synchronous, Asynchronous, and Randomized Best-Response Schemes for Stochastic Nash Games, Asynchronous parallel algorithms for nonconvex optimization, Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs, A coordinate gradient descent method for nonsmooth separable minimization, Incrementally updated gradient methods for constrained and regularized optimization, ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates, On asynchronous iterations, Error bounds and convergence analysis of feasible descent methods: A general approach, Computational study of the nonhierarchical decomposition algorithm, A unified description of iterative algorithms for traffic equilibria