Pages that link to "Item:Q5352733"
From MaRDI portal
The following pages link to Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling (Q5352733):
Displaying 50 items.
- Adaptive backstepping for distributed optimization (Q2139422) (← links)
- Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization (Q2154832) (← links)
- Large-scale multivariate sparse regression with applications to UK Biobank (Q2170442) (← links)
- A distributed conjugate gradient online learning method over networks (Q2173726) (← links)
- A unitary distributed subgradient method for multi-agent optimization with different coupling sources (Q2174029) (← links)
- Distributed constrained optimization for multi-agent systems over a directed graph with piecewise stepsize (Q2181379) (← links)
- Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
- Tracking-ADMM for distributed constraint-coupled optimization (Q2184513) (← links)
- A distributed fixed-time optimization algorithm for multi-agent systems (Q2208611) (← links)
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint (Q2218645) (← links)
- Cooperative convex optimization with subgradient delays using push-sum distributed dual averaging (Q2230849) (← links)
- Distributed nonsmooth convex optimization over Markovian switching random networks with two step-sizes (Q2235612) (← links)
- Convergence of distributed gradient-tracking-based optimization algorithms with random graphs (Q2235622) (← links)
- Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817) (← links)
- Relative tempo of distributed averaging on networks (Q2280682) (← links)
- Mass-spring-damper networks for distributed optimization in non-Euclidean spaces (Q2288705) (← links)
- Communication-efficient algorithms for decentralized and stochastic optimization (Q2297648) (← links)
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs (Q2318770) (← links)
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics (Q2327803) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Multi-cluster distributed optimization via random sleep strategy (Q2423910) (← links)
- Distributed model predictive control for linear systems under communication noise: algorithm, theory and implementation (Q2663917) (← links)
- Cluster-based distributed augmented Lagrangian algorithm for a class of constrained convex optimization problems (Q2665106) (← links)
- Subgradient averaging for multi-agent optimisation with different constraint sets (Q2665377) (← links)
- Distributed constraint-coupled optimization via primal decomposition over random time-varying graphs (Q2665379) (← links)
- Differentially private distributed optimization for multi-agent systems via the augmented Lagrangian algorithm (Q2666749) (← links)
- Generalized Nash equilibrium seeking algorithm design for distributed multi-cluster games (Q2680260) (← links)
- Distributed average tracking for uncertain directed multiagent networks (Q2687778) (← links)
- Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization (Q2696990) (← links)
- Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
- Noise-to-state exponentially stable distributed convex optimization on weight-balanced digraphs (Q2796003) (← links)
- Distributed convex optimisation with event-triggered communication in networked systems (Q2821410) (← links)
- On the convergence of decentralized gradient descent (Q2821798) (← links)
- On convergence rate of distributed stochastic gradient algorithm for convex optimization with inequality constraints (Q2827487) (← links)
- Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties (Q2954387) (← links)
- Distributed subgradient method for multi-agent optimization with quantized communication (Q2978003) (← links)
- Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme (Q2994221) (← links)
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication (Q3391269) (← links)
- Asymptotic Properties of Primal-Dual Algorithm for Distributed Stochastic Optimization over Random Networks with Imperfect Communications (Q4568061) (← links)
- Linear Time Average Consensus and Distributed Optimization on Fixed Graphs (Q4599719) (← links)
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs (Q4602346) (← links)
- Networked Parallel Algorithms for Robust Convex Optimization via the Scenario Approach (Q4625791) (← links)
- (Q4637046) (← links)
- Decentralized Consensus Algorithm with Delayed and Stochastic Gradients (Q4641647) (← links)
- Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods (Q4641660) (← links)
- Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent (Q4969072) (← links)
- GADMM: Fast and Communication Efficient Framework for Distributed Machine Learning (Q4969135) (← links)
- Distributed Bregman-Distance Algorithms for Min-Max Optimization (Q5023087) (← links)
- Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes (Q5027526) (← links)
- Event-triggered zero-gradient-sum distributed optimisation algorithm with time-varying communication delays (Q5028024) (← links)