activity
20172026
most citedRiemannian Smoothing Gradient Type Algorithms]{Riemannian Smoothing Gradient Type Algorithms for Nonsmooth Optimization Problem on Compact Riemannian Submanifold Embedded in Euclidean Space

7 citations · 18 across the 14 of their papers we have counts for

collaborators
Showing 2023 · math.OCShow all

7 papers · 2 filters

math.OC2023

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization

Zhanwang Deng, Kangkang Deng, Jiang Hu +1

In this paper, we develop a novel primal-dual semismooth Newton method for solving linearly constrained multi-block convex composite optimization problems. First, a differentiable…

math.OC2023★ 1 cited

Decentralized Douglas-Rachford splitting methods for smooth optimization over compact submanifolds

Kangkang Deng, Jiang Hu, Hongxia Wang

We study decentralized smooth optimization problems over compact submanifolds. Recasting it as a composite optimization problem, we propose a decentralized Douglas-Rachford splitti…

math.OC2023

Achieving Consensus over Compact Submanifolds

Jiang Hu, Jiaojiao Zhang, Kangkang Deng

We consider the consensus problem in a decentralized network, focusing on a compact submanifold that acts as a nonconvex constraint set. By leveraging the proximal smoothness of th…

math.OC2023★ 4 cited

Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds

Kangkang Deng, Jiang Hu

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 smooth. Leve…

math.OC2023

Decentralized Weakly Convex Optimization Over the Stiefel Manifold

Jinxin Wang, Jiang Hu, Shixiang Chen +2

We focus on a class of non-smooth optimization problems over the Stiefel manifold in the decentralized setting, where a connected network of agents cooperatively minimize a fin…

math.OC2023★ 1 cited

Decentralized Riemannian natural gradient methods with Kronecker-product approximations

Jiang Hu, Kangkang Deng, Na Li +1

With a computationally efficient approximation of the second-order information, natural gradient methods have been successful in solving large-scale structured optimization problem…