Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds

K Deng, J Hu - arxiv preprint arxiv:2304.08241, 2023‏ - arxiv.org
We consider the problem of decentralized nonconvex optimization over a compact
submanifold, where each local agent's objective function defined by the local dataset is …

Decentralized matrix sensing: statistical guarantees and fast convergence

M Maros, G Scutari - Advances in Neural Information …, 2023‏ - proceedings.neurips.cc
We explore the matrix sensing problem from near-isotropic linear measurements, distributed
across a network of agents modeled as an undirected graph, with no centralized node. We …

Smoothing ADMM for Sparse-Penalized Quantile Regression With Non-Convex Penalties

R Mirzaeifard, NKD Venkategowda… - IEEE Open Journal …, 2023‏ - ieeexplore.ieee.org
This paper investigates quantile regression in the presence of non-convex and non-smooth
sparse penalties, such as the minimax concave penalty (MCP) and smoothly clipped …

A Double Tracking Method for Optimization with Decentralized Generalized Orthogonality Constraints

L Wang, N **ao, X Liu - arxiv preprint arxiv:2409.04998, 2024‏ - arxiv.org
In this paper, we consider the decentralized optimization problems with generalized
orthogonality constraints, where both the objective function and the constraint exhibit a …