math.OCNov 5, 2026

Projection-Free Gradient Tracking Neurodynamic for Distributed Nonnegative Sparse Optimization

Authors: Juntao Li, Qihang Guo, Deyuan Meng

Organizations: School of Mathematics and Statistics, Henan Normal University, Xinxiang 453007, P. R. China · Seventh Research Division, School of Automation Science and Electrical Engineering, Beihang University (BUAA), Beijing 100191, P. R. China

Abstract

This paper proposes a continuous-time, projection-free neurodynamic system based on gradient tracking for distributed nonnegative sparse optimization. Unlike traditional methods, our approach avoids projecting states onto the feasible set. Instead, it employs gradient tracking to estimate average gradients under heterogeneous costs, coupling primal and dual dynamics such that feasibility and sparsity emerge naturally from the equilibrium conditions. The system ensures unique solutions through a locally Lipschitz vector field and guarantees that every equilibrium corresponds to an exact KKT point. We establish rigorous convergence guarantees for convex objectives through three distinct analytical layers. These include a centralized kernel rate, a computable distributed rate derived from Jacobian analysis without restrictive stability assumptions, and a global exponential stability proof based on Lur'e system theory. Our analysis quantitatively separates these layers, revealing that the convergence rate is primarily limited by graph sparsity and remains robust to variations in momentum time scales. Numerical experiments on strongly convex quadratic problems validate the theoretical rates, demonstrate effective active set recovery, and show that the system maintains stable tail convergence rates even under strong local heterogeneity.

Figures & tables

Explore similar work

CardsList
  1. A Bilevel Neurodynamic Approach for Distributed SCAD-Regularized Sparse Least Squares

    Nov 5, 2026Juntao Li, Qihang Guo, Deyuan MengSparse RecoveryDistributed Optimization

  2. Second-Order KKT Guarantees for Bregman ADMM in Nonconvex and Non-Lipschitz Optimization

    Jun 26, 2026Shuang Li, Zhihui Zhu, Qiuwei LiOptimization Convergence AnalysisDistributed Optimization

  3. DisMUSE: An Efficient Distributed Singular-Spectrum-Based Optimization Approach with Theoretical Convergence Guarantee

    Nov 6, 2026Zhen Qin, Zhiyao Zhang, Yingbin Liang +1Distributed OptimizationSpectral Optimization