scientific article
From MaRDI portal
Publication:2768028
zbMath0997.90102MaRDI QIDQ2768028
Vivek S. Borkar, Dimitri P. Bertsekas, Angelia Nedić
Publication date: 18 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays, Approximation accuracy, gradient methods, and error bound for structured convex optimization, Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Asynchronous parallel algorithms for nonconvex optimization, On stochastic gradient and subgradient methods with adaptive steplength sequences, Incremental proximal methods for large scale convex optimization, The effect of deterministic noise in subgradient methods, An Asynchronous Bundle-Trust-Region Method for Dual Decomposition of Stochastic Mixed-Integer Programming, A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints, Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods, Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions, Near-optimal stochastic approximation for online principal component estimation, Asynchronous Lagrangian scenario decomposition, An incremental subgradient method on Riemannian manifolds, Stochastic First-Order Methods with Random Constraint Projection, Communication-efficient algorithms for decentralized and stochastic optimization, Projected equation methods for approximate solution of large linear systems, ARock: An Algorithmic Framework for Asynchronous Parallel Coordinate Updates, Projection algorithms with dynamic stepsize for constrained composite minimization, Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems
