Related Experiment Video
Updated: Jun 28, 2025

A Protocol for Real-time 3D Single Particle Tracking
Published on: January 3, 2018
Quantized Zeroth-Order Gradient Tracking Algorithm for Distributed Nonconvex Optimization Under Polyak-Łojasiewicz
Abstract:
This article focuses on distributed nonconvex optimization by exchanging information between agents to minimize the average of local nonconvex cost functions. The communication channel between agents is normally constrained by limited bandwidth, and the gradient information is typically unavailable. To overcome these limitations, we propose a quantized distributed zeroth-order algorithm, which integrates the deterministic gradient estimator, the standard uniform quantizer, and the distributed gradient tracking algorithm. We establish linear convergence to a global optimal point for the proposed algorithm by assuming Polyak-Łojasiewicz condition for the global cost function and smoothness condition for the local cost functions. Moreover, the proposed algorithm maintains linear convergence at low-data rates with a proper selection of algorithm parameters. Numerical simulations validate the theoretical results.
More Related Videos
Related Concept Videos
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
Second Derivatives and Laplace Operator
Consider a scalar function. The curl of its...
Curvilinear Motion: Polar Coordinates
The particle's location is described using a unit vector along the radial direction. Deriving the particle's position...
Gradient and Del Operator
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...

