Pages that link to "Item:Q3586129"
From MaRDI portal
The following pages link to A Randomized Incremental Subgradient Method for Distributed Optimization in Networked Systems (Q3586129):
Displaying 48 items.
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems (Q286313) (← links)
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
- Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings (Q312694) (← links)
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs (Q389827) (← links)
- A distributed hierarchical algorithm for multi-cluster constrained optimization (Q510122) (← links)
- Distributed convergence to Nash equilibria in two-network zero-sum games (Q522807) (← links)
- Incremental proximal methods for large scale convex optimization (Q644913) (← links)
- Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
- Distributed optimal in-network resource allocation algorithm design via a control theoretic approach (Q1680667) (← links)
- Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication (Q1689381) (← links)
- Network-decentralised optimisation and control: an explicit saturated solution (Q1737853) (← links)
- Distributed optimization with information-constrained population dynamics (Q1757497) (← links)
- Distributed extremum-seeking control over networks of dynamically coupled unstable dynamic agents (Q1797064) (← links)
- Randomized optimal consensus of multi-agent systems (Q1932692) (← links)
- Parallel alternating direction method of multipliers (Q1999014) (← links)
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions (Q2010105) (← links)
- Gradient-free method for nonsmooth distributed optimization (Q2018475) (← links)
- A distributed continuous-time modified Newton-Raphson algorithm (Q2063762) (← links)
- Adaptive optimization with periodic dither signals (Q2070015) (← links)
- Projected subgradient based distributed convex optimization with transmission noises (Q2073071) (← links)
- Distributed optimization for uncertain nonlinear interconnected multi-agent systems (Q2086990) (← links)
- A distributed fixed-time optimization algorithm for multi-agent systems (Q2208611) (← links)
- Accelerating the distributed Kaczmarz algorithm by strong over-relaxation (Q2228508) (← links)
- A simple self-triggered sampler for perturbed nonlinear systems (Q2252969) (← links)
- Measurement-based efficient resource allocation with demand-side adjustments (Q2280775) (← links)
- Distributed coordination for nonsmooth convex optimization via saddle-point dynamics (Q2327803) (← links)
- The incremental subgradient methods on distributed estimations in-network (Q2335919) (← links)
- Incremental gradient-free method for nonsmooth distributed optimization (Q2411165) (← links)
- Convergence of random sleep algorithms for optimal consensus (Q2437791) (← links)
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints (Q2829569) (← links)
- Distributed Algorithms for Aggregative Games on Graphs (Q2830752) (← links)
- Distributed subgradient method for multi-agent optimization with quantized communication (Q2978003) (← links)
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication (Q3391269) (← links)
- Distributed Line Search for Multiagent Convex Optimization (Q4558869) (← links)
- Surpassing Gradient Descent Provably: A Cyclic Incremental Method with Linear Convergence Rate (Q4641666) (← links)
- Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent (Q4969072) (← links)
- A Kaczmarz Algorithm for Solving Tree Based Distributed Systems of Equations (Q5020146) (← links)
- Distributed Bregman-Distance Algorithms for Min-Max Optimization (Q5023087) (← links)
- Primal-dual algorithms for multi-agent structured optimization over message-passing architectures with bounded communication delays (Q5058405) (← links)
- Recent advances in optimization and game theoretic control for networked systems (Q5131085) (← links)
- A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints (Q5152474) (← links)
- An Optimal Algorithm for Decentralized Finite-Sum Optimization (Q5162661) (← links)
- Path-based incremental target level algorithm on Riemannian manifolds (Q5221271) (← links)
- Strong consistency of random gradient‐free algorithms for distributed optimization (Q5346596) (← links)
- Distributed time‐varying convex optimal consensus control for multi‐agent system with/without chattering restrain (Q6078637) (← links)
- Distributed time‐varying optimization control for multirobot systems with collision avoidance by hierarchical approach (Q6149941) (← links)
- A Unified Framework for Continuous-Time Unconstrained Distributed Optimization (Q6173814) (← links)
- A distributed finite‐time optimization algorithm for directed networks of continuous‐time agents (Q6197946) (← links)