Pages that link to "Item:Q620442"

The following pages link to Distributed stochastic subgradient projection algorithms for convex optimization (Q620442):

Displaying 50 items.

• Stopping rules for optimization algorithms based on stochastic approximation (Q289128) (← links)
• Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
• Primal-dual algorithm for distributed constrained optimization (Q325079) (← links)
• On stochastic gradient and subgradient methods with adaptive steplength sequences (Q445032) (← links)
• Inexact dual averaging method for distributed multi-agent optimization (Q460593) (← links)
• Incremental proximal methods for large scale convex optimization (Q644913) (← links)
• Geometrical convergence rate for distributed optimization with time-varying directed graphs and uncoordinated step-sizes (Q781032) (← links)
• Event-triggered zero-gradient-sum distributed consensus optimization over directed networks (Q905784) (← links)
• Distributed multi-agent optimization subject to nonidentical constraints and communication delays (Q905789) (← links)
• Distributed multi-task classification: a decentralized online learning approach (Q1640564) (← links)
• Optimal distributed stochastic mirror descent for strongly convex optimization (Q1640744) (← links)
• Distributed resource allocation over random networks based on stochastic approximation (Q1643399) (← links)
• Stochastic mirror descent method for distributed multi-agent optimization (Q1670526) (← links)
• Distributed optimization methods for nonconvex problems with inequality constraints over time-varying networks (Q1694193) (← links)
• Distributed constrained optimization via continuous-time mirror design (Q1713810) (← links)
• Distributed optimization with closed convex set for multi-agent networks over directed graphs (Q1717465) (← links)
• Asynchronous gossip-based gradient-free method for multiagent optimization (Q1724545) (← links)
• Distributed quasi-monotone subgradient algorithm for nonsmooth convex optimization over directed graphs (Q1737711) (← links)
• Distributed optimization over directed graphs with row stochasticity and constraint regularity (Q1737783) (← links)
• Distributed consensus-based multi-agent convex optimization via gradient tracking technique (Q1738645) (← links)
• Distributed convex optimization with coupling constraints over time-varying directed graphs (Q1983757) (← links)
• Communication-computation tradeoff in distributed consensus optimization for MPC-based coordinated control under wireless communications (Q2012089) (← links)
• Gradient-free method for nonsmooth distributed optimization (Q2018475) (← links)
• Distributed stochastic gradient tracking methods (Q2020611) (← links)
• A decentralized multi-objective optimization algorithm (Q2032002) (← links)
• On the linear convergence of two decentralized algorithms (Q2032033) (← links)
• Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning (Q2045021) (← links)
• A multi-scale method for distributed convex optimization with constraints (Q2073060) (← links)
• Convergence results of a nested decentralized gradient method for non-strongly convex problems (Q2082236) (← links)
• On arbitrary compression for decentralized consensus and stochastic optimization over directed networks (Q2095323) (← links)
• Distributed stochastic nonsmooth nonconvex optimization (Q2102823) (← links)
• Asymptotic properties of dual averaging algorithm for constrained distributed stochastic optimization (Q2154832) (← links)
• Regularized dual gradient distributed method for constrained convex optimization over unbalanced directed graphs (Q2181641) (← links)
• Distributed Nash equilibrium computation in aggregative games: an event-triggered algorithm (Q2212584) (← links)
• A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights (Q2293057) (← 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 stochastic subgradient projection algorithms based on weight-balancing over time-varying directed graphs (Q2331322) (← links)
• Distributed Newton methods for strictly convex consensus optimization problems in multi-agent networks (Q2333555) (← links)
• Primal-dual stochastic distributed algorithm for constrained convex optimization (Q2334189) (← links)
• Distributed model predictive control for linear systems under communication noise: algorithm, theory and implementation (Q2663917) (← links)
• Privacy-preserving dual stochastic push-sum algorithm for distributed constrained optimization (Q2696990) (← links)
• Noise-to-State Exponentially Stable Distributed Convex Optimization on Weight-Balanced Digraphs (Q2796003) (← 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)
• Distributed Algorithms for Aggregative Games on Graphs (Q2830752) (← links)
• A new class of distributed optimization algorithms: application to regression of distributed data (Q2885464) (← links)
• Stochastic sub-gradient algorithm for distributed optimization with random sleep scheme (Q2994221) (← links)
• Revisiting EXTRA for Smooth Distributed Optimization (Q3300767) (← links)
• Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication (Q3391269) (← links)