scientific article
From MaRDI portal
Publication:3079674
zbMath1241.90100MaRDI QIDQ3079674
Angelia Nedić, Asuman Ozdaglar
Publication date: 2 March 2011
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
consensus algorithmsdual-subgradient methodsglobal-objective functionLagrangian-decompositionlocal-objective functions
Convex programming (90C25) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)
Related Items
The Walrasian equilibrium and centralized distributed optimization in terms of modern convex optimization methods on the example of resource allocation problem, Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings, Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings, Proximal point algorithms for nonsmooth convex optimization with fixed point constraints, Inertial accelerated primal-dual methods for linear equality constrained convex optimization problems, Cooperative concurrent asynchronous computation of the solution of symmetric linear systems, Strong consistency of random gradient‐free algorithms for distributed optimization, Distributed stochastic subgradient projection algorithms for convex optimization, Zeroth-order feedback optimization for cooperative multi-agent systems, Consensus-based Dantzig-Wolfe decomposition, Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs, Approximate dual averaging method for multiagent saddle-point problems with stochastic subgradients, Decentralized algorithm for centralized variational inequalities in network resource allocation, Distributed dual averaging method for multi-agent optimization with quantized communication, Distributed Robust Subspace Recovery, A cooperative conjugate gradient method for linear systems permitting efficient multi-thread implementation, A decentralized multi-objective optimization algorithm, A Distributed ADMM-like Method for Resource Sharing over Time-Varying Networks, Resource Allocation in Communication Networks with Large Number of Users: The Dual Stochastic Gradient Method, Convergence Analysis of Approximate Primal Solutions in Dual First-Order Methods, Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes
