Hui Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Hui Zhang has a total of 29 co-authors. Here are the top co-authors by number of shared publications:
- Lu Zhang
College of Science, National University of Defense Technology, Changsha, China
8 shared publications - Hongxia Wang
College of Science, National University of Defense Technology, Changsha, China
6 shared publications - Wei Peng
Defense Innovation Institute, Chinese Academy of Military Science Intelligent Game and Decision Laboratory, Beijing, China
5 shared publications - Yu-Hong Dai
Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing, China
5 shared publications - Lizhi Cheng
Department of Mathematics National University of Defense Technology 410073 Changsha Hunan China
4 shared publications Wei Peng
Defense Innovation Institute, Chinese Academy of Military Science, Beijing, China
4 shared publications
Latest Publications
- 12 September 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 493
Relaxed greedy randomized Kaczmarz with signal averaging for solving doubly-noisy linear systems
- 12 September 2026
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 493
Relaxed greedy randomized Kaczmarz with signal averaging for solving doubly-noisy linear systems
- 7 May 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (3) , 92
Nonlinear Preconditioned Primal-Dual Method with Projection for Nonconvex-Nonconcave Minimax Problems
- 7 May 2026
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 107 (3) , 92
Nonlinear Preconditioned Primal-Dual Method with Projection for Nonconvex-Nonconcave Minimax Problems
- 30 December 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (2) , 74
On Degenerate Preconditioned Proximal Point Methods under Restricted Monotonicity
- 30 December 2025
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 208 (2) , 74
On Degenerate Preconditioned Proximal Point Methods under Restricted Monotonicity
- Open Access
- 22 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 977-982
A Randomized Sparse Kaczmarz Method for Doubly-Noisy Linear Systems
- 22 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 977-982
Open AccessA Randomized Sparse Kaczmarz Method for Doubly-Noisy Linear Systems
- 13 May 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 98 (3) , 1575-1610
Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems
- 13 May 2024
- Published by Springer Nature in Numerical Algorithms
- Vol. 98 (3) , 1575-1610
Quantile-based random sparse Kaczmarz for corrupted and noisy linear systems
- Open Access
A cut-and-project perspective for linearized Bregman iterations
The linearized Bregman iterations (LBreI) and its variants are powerful tools for finding sparse or low-rank solutions to underdetermined linear systems. In this study, we propose a cut-and-project perspective for the linearized Bregman method via a bilevel optimization formulation, along with a new unified algorithmic framework. The new perspective not only encompasses various existing linearized Bregman iteration variants as specific instances, but also allows us to extend the linearized Bregman method to solve more general inverse problems. We provide a completed convergence result of the proposed algorithmic framework, including convergence guarantees to feasible points and optimal solutions, and the sublinear convergence rate. Moreover, we introduce the Bregman distance growth condition to ensure linear convergence. At last, our findings are illustrated via numerical tests.
Open AccessA cut-and-project perspective for linearized Bregman iterations
The linearized Bregman iterations (LBreI) and its variants are powerful tools for finding sparse or low-rank solutions to underdetermined linear systems. In this study, we propose a cut-and-project perspective for the linearized Bregman method via a bilevel optimization formulation, along with a new unified algorithmic framework. The new perspective not only encompasses various existing linearized Bregman iteration variants as specific instances, but also allows us to extend the linearized Bregman method to solve more general inverse problems. We provide a completed convergence result of the proposed algorithmic framework, including convergence guarantees to feasible points and optimal solutions, and the sublinear convergence rate. Moreover, we introduce the Bregman distance growth condition to ensure linear convergence. At last, our findings are illustrated via numerical tests.
- Open Access
Nonlinear preconditioned primal-dual method for a class of structured minimax problems
We propose and analyze a general framework called nonlinear preconditioned primal-dual with projection for solving nonconvex-nonconcave and non-smooth saddle-point problems. The framework consists of two steps. The first is a nonlinear preconditioned map followed by a relaxed projection onto the separating hyperspace we construct. One key to the method is the selection of preconditioned operators, which tailors to the structure of the saddle-point problem and is allowed to be nonlinear and asymmetric. The other is the construction of separating hyperspace, which guarantees fast convergence. This framework paves the way for constructing nonlinear preconditioned primal-dual algorithms. We show that weak convergence, and so is sublinear convergence under the assumption of the convexity of saddle-point problems and linear convergence under a metric subregularity. We also show that many existing primal-daul methods, such as the generalized primal-dual algorithm method, are special cases of relaxed preconditioned primal-dual with projection.
Open AccessNonlinear preconditioned primal-dual method for a class of structured minimax problems
We propose and analyze a general framework called nonlinear preconditioned primal-dual with projection for solving nonconvex-nonconcave and non-smooth saddle-point problems. The framework consists of two steps. The first is a nonlinear preconditioned map followed by a relaxed projection onto the separating hyperspace we construct. One key to the method is the selection of preconditioned operators, which tailors to the structure of the saddle-point problem and is allowed to be nonlinear and asymmetric. The other is the construction of separating hyperspace, which guarantees fast convergence. This framework paves the way for constructing nonlinear preconditioned primal-dual algorithms. We show that weak convergence, and so is sublinear convergence under the assumption of the convexity of saddle-point problems and linear convergence under a metric subregularity. We also show that many existing primal-daul methods, such as the generalized primal-dual algorithm method, are special cases of relaxed preconditioned primal-dual with projection.
- Open Access
Quantile-based Random Sparse Kaczmarz for Corrupted and Noisy Linear Systems
The randomzied Kaczmarz method, along with its recently developed variants, has become a popular tool for dealing with large-scale linear systems. However, these methods usually fail to converge when the linear systems are affected by heavy corruptions, which are common in many practical applications. In this study, we develop a new variant of the randomzied sparse Kaczmarz method with linear convergence guarantees, by making use of a quantile technique to detect corruptions. Moreover, we incorporate averaged block technique into the proposed method to achieve parallel computation and acceleration. Finally, the proposed algorithms are illustrated to be very efficient through extensive numerical experiments.
Open AccessQuantile-based Random Sparse Kaczmarz for Corrupted and Noisy Linear Systems
The randomzied Kaczmarz method, along with its recently developed variants, has become a popular tool for dealing with large-scale linear systems. However, these methods usually fail to converge when the linear systems are affected by heavy corruptions, which are common in many practical applications. In this study, we develop a new variant of the randomzied sparse Kaczmarz method with linear convergence guarantees, by making use of a quantile technique to detect corruptions. Moreover, we incorporate averaged block technique into the proposed method to achieve parallel computation and acceleration. Finally, the proposed algorithms are illustrated to be very efficient through extensive numerical experiments.
- Open Access
A Weighted Randomized Sparse Kaczmarz Method for Solving Linear Systems
The randomized sparse Kaczmarz method, designed for seeking the sparse solutions of the linear systems $Ax=b$, selects the $i$-th projection hyperplane with likelihood proportional to $\|a_{i}\|_2^2$, where $a_{i}^T$ is $i$-th row of $A$. In this work, we propose a weighted randomized sparse Kaczmarz method, which selects the $i$-th projection hyperplane with probability proportional to $\lvert\langle a_{i},x_{k}\rangle-b_{i}\rvert^p$, where $0<p<\infty$, for possible acceleration. It bridges the randomized Kaczmarz and greedy Kaczmarz by parameter $p$. Theoretically, we show its linear convergence rate in expectation with respect to the Bregman distance in the noiseless and noisy cases, which is at least as efficient as the randomized sparse Kaczmarz method. The superiority of the proposed method is demonstrated via a group of numerical experiments.Open AccessA Weighted Randomized Sparse Kaczmarz Method for Solving Linear Systems
The randomized sparse Kaczmarz method, designed for seeking the sparse solutions of the linear systems $Ax=b$, selects the $i$-th projection hyperplane with likelihood proportional to $\|a_{i}\|_2^2$, where $a_{i}^T$ is $i$-th row of $A$. In this work, we propose a weighted randomized sparse Kaczmarz method, which selects the $i$-th projection hyperplane with probability proportional to $\lvert\langle a_{i},x_{k}\rangle-b_{i}\rvert^p$, where $0<p<\infty$, for possible acceleration. It bridges the randomized Kaczmarz and greedy Kaczmarz by parameter $p$. Theoretically, we show its linear convergence rate in expectation with respect to the Bregman distance in the noiseless and noisy cases, which is at least as efficient as the randomized sparse Kaczmarz method. The superiority of the proposed method is demonstrated via a group of numerical experiments. - Open Access
- 2 June 2023
- Published by Wiley
Alternating Block Linearized Bregman Iterations for Regularized Nonnegative Matrix Factorization
In this paper, we propose an alternating block variant of the linearized Bregman iterations for a class of regularized nonnegative matrix factorization problems (NMF). The proposed method exploits the block structure of NMF, utilizes the smooth adaptable property of the loss function based on the Bregman distance, and at the same time follows the iterative regularization idea of the linearized Bregman iterations method. Theoretically, we show that the proposed method is a descent method by adjusting the involved parameters. Finally, we end with several illustrative numerical experiments.
- 2 June 2023
- Published by Wiley
Open AccessAlternating Block Linearized Bregman Iterations for Regularized Nonnegative Matrix Factorization
In this paper, we propose an alternating block variant of the linearized Bregman iterations for a class of regularized nonnegative matrix factorization problems (NMF). The proposed method exploits the block structure of NMF, utilizes the smooth adaptable property of the loss function based on the Bregman distance, and at the same time follows the iterative regularization idea of the linearized Bregman iterations method. Theoretically, we show that the proposed method is a descent method by adjusting the involved parameters. Finally, we end with several illustrative numerical experiments.