Non-Convex Distributed Optimization
From MaRDI portal
Abstract: We study distributed non-convex optimization on a time-varying multi-agent network. Each node has access to its own smooth local cost function, and the collective goal is to minimize the sum of these functions. We generalize the results obtained previously to the case of non-convex functions. Under some additional technical assumptions on the gradients we prove the convergence of the distributed push-sum algorithm to some critical point of the objective function. By utilizing perturbations on the update process, we show the almost sure convergence of the perturbed dynamics to a local minimum of the global objective function. Our analysis shows that this noised procedure converges at a rate of .
Recommendations
- Distributed stochastic nonsmooth nonconvex optimization
- scientific article; zbMATH DE number 2187960
- Distributed Global Optimization for a Class of Nonconvex Optimization With Coupled Constraints
- A two-level distributed algorithm for nonconvex constrained optimization
- Distributed Continuous-Time Nonsmooth Convex Optimization With Coupled Inequality Constraints
- Distributed optimization over networks
- Randomized Algorithms for Distributed Nonlinear Optimization Under Sparsity Constraints
- Approximations in Distributed Optimization
- Distributed Zero-Order Algorithms for Nonconvex Multiagent Optimization
- On decentralized nonsmooth optimization
Cited in
(28)- Stochastic learning in multi-agent optimization: communication and payoff-based approaches
- A distributed asynchronous method of multipliers for constrained nonconvex optimization
- One dimensional consensus based algorithm for non-convex optimization
- Distributed stochastic nonsmooth nonconvex optimization
- Zeroth-order algorithms for stochastic distributed nonconvex optimization
- Measurement-based efficient resource allocation with demand-side adjustments
- Distributed nonconvex constrained optimization over time-varying digraphs
- Nonconvex Optimization for Communication Networks
- scientific article; zbMATH DE number 4081262 (Why is no real title available?)
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- Distributed Learning in Non-Convex Environments— Part II: Polynomial Escape From Saddle-Points
- Second-order guarantees of distributed gradient algorithms
- Decentralized dictionary learning over time-varying digraphs
- A simple framework for stability analysis of state-dependent networks of heterogeneous agents
- Decentralized nonconvex optimization with guaranteed privacy and accuracy
- An event-triggered collaborative neurodynamic approach to distributed global optimization
- DIMIX: Diminishing Mixing for Sloppy Agents
- A collective neurodynamic penalty approach to nonconvex distributed constrained optimization
- Generalized left-localized Cayley parametrization for optimization with orthogonality constraints
- Distributed primal-dual method on unbalanced digraphs with row stochasticity
- Consensus-based primal-dual method with event-triggered communication
- One-point residual feedback algorithms for distributed online convex and non-convex optimization
- Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds embedded in the Euclidean space
- Almost sure convergence of distributed optimization with imperfect information sharing
- On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
- Distributed aggregative optimization over directed networks with column-stochasticity
- Distributed gradient descent method with edge-based event-driven communication for non-convex optimization
- An improved convergence guarantee for the gradient-push algorithm with a constant stepsize
This page was built for publication: Non-Convex Distributed Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4589436)
