Yun-Bin Zhao
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Yun-Bin Zhao has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Zhong-Feng Sun
School of Mathematics and Statistics Shandong University of Technology Zibo Shandong China
8 shared publications - Jinchuan Zhou
School of Mathematics and Statistics, Shandong University of Technology, Zibo 255000, China
5 shared publications - Nan Meng
School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK
5 shared publications - Zhi-Quan Luo
The Chinese University of Hong Kong
5 shared publications - Zheng-Hai Huang
School of Mathematics, Tianjin University, Tianjin, China
4 shared publications - ChunLei Xu
School of Mathematics, University of Birmingham, Edgbaston, Birmingham, UK
2 shared publications
Latest Publications
- 20 August 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 96 (1) , 115-140
Compressed Newton-direction-based thresholding methods for sparse optimization problems
- 20 August 2026
- Published by Springer Nature in Journal of Global Optimization
- Vol. 96 (1) , 115-140
Compressed Newton-direction-based thresholding methods for sparse optimization problems
- 24 April 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (5)
General decomposition pursuit algorithm for linear inverse problems
Over the past few decades, various numerical methods have been developed to solve linear inverse problems with sparse solutions. However, there remains a shortage of efficient algorithms specifically tailored for large-scale problems. In this paper, we work toward bridging this gap by developing the so-called \emph{General Decomposition Pursuit} algorithm, which is designed to directly tackle a large-scale problem. This algorithmic framework is notably distinct from any existing sparsity-aware method. The main mechanism of the algorithm involves decomposing a large problem into several mutually coupled small subproblems and then combining the (inexact) solutions of these subproblems to generate a sparse solution to the original problem. The global convergence of the algorithm is shown under the restricted isometry property. Simulations with synthetic data and applications in medical image reconstruction indicate that the proposed algorithm, when equipped with an appropriate inner solver for subproblems, can outperform several mainstream algorithms in success rates for locating the sparse solution to the problem.
- 24 April 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (5)
General decomposition pursuit algorithm for linear inverse problems
Over the past few decades, various numerical methods have been developed to solve linear inverse problems with sparse solutions. However, there remains a shortage of efficient algorithms specifically tailored for large-scale problems. In this paper, we work toward bridging this gap by developing the so-called \emph{General Decomposition Pursuit} algorithm, which is designed to directly tackle a large-scale problem. This algorithmic framework is notably distinct from any existing sparsity-aware method. The main mechanism of the algorithm involves decomposing a large problem into several mutually coupled small subproblems and then combining the (inexact) solutions of these subproblems to generate a sparse solution to the original problem. The global convergence of the algorithm is shown under the restricted isometry property. Simulations with synthetic data and applications in medical image reconstruction indicate that the proposed algorithm, when equipped with an appropriate inner solver for subproblems, can outperform several mainstream algorithms in success rates for locating the sparse solution to the problem.
- Open Access
Optimality Conditions for Sparse Bilinear Least Squares Problems
The first-order optimality conditions of sparse bilinear least squares problems are studied. The so-called T-type and N-type stationary points for this problem are characterized in terms of tangent cone and normal cone in Bouligand and Clarke senses, and another stationarity concept called the coordinate-wise minima is introduced and discussed. Moreover, the L-like stationary point for this problem is introduced and analyzed through the newly introduced concept of like-projection, and the M-stationary point is also investigated via a complementarity-type reformulation of the problem. The relationship between these stationary points is discussed as well. It turns out that all stationary points discussed in this work satisfy the necessary optimality conditions for the sparse bilinear least squares problem.
Open AccessOptimality Conditions for Sparse Bilinear Least Squares Problems
The first-order optimality conditions of sparse bilinear least squares problems are studied. The so-called T-type and N-type stationary points for this problem are characterized in terms of tangent cone and normal cone in Bouligand and Clarke senses, and another stationarity concept called the coordinate-wise minima is introduced and discussed. Moreover, the L-like stationary point for this problem is introduced and analyzed through the newly introduced concept of like-projection, and the M-stationary point is also investigated via a complementarity-type reformulation of the problem. The relationship between these stationary points is discussed as well. It turns out that all stationary points discussed in this work satisfy the necessary optimality conditions for the sparse bilinear least squares problem.
- 13 January 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (1)
Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
In this paper, we propose two Levenberg-Marquardt methods merged with hard thresholding pursuits for solving sparse bilinear inverse problems. Our second method is an improvement of the first one by incorporating a novel support set refinement step. Under suitable assumptions, we show that the proposed methods are globally and locally quadratically convergent to an optimal solution of the underlying problem. The efficiency of the algorithms is demonstrated through numerical experiments on randomly generated problems which indicate the superior performance of the proposed methods compared to several existing methods.
- 13 January 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (1)
Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
In this paper, we propose two Levenberg-Marquardt methods merged with hard thresholding pursuits for solving sparse bilinear inverse problems. Our second method is an improvement of the first one by incorporating a novel support set refinement step. Under suitable assumptions, we show that the proposed methods are globally and locally quadratically convergent to an optimal solution of the underlying problem. The efficiency of the algorithms is demonstrated through numerical experiments on randomly generated problems which indicate the superior performance of the proposed methods compared to several existing methods.
- 10 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 46 (4) , 2310-2330
Splitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into the two-block splitting alternating algorithm (TSAA) and the multiblock splitting alternating algorithm (MSAA). These algorithms aim to decompose a large-scale linear system into two or more coupled subsystems, each significantly smaller than the original system, and then combine the solutions of these subsystems to produce the sparse solution of the original system. The proposed algorithms only involve matrix-vector products and reduced orthogonal projections. It turns out that the proposed algorithms are globally convergent to the sparse solution of a linear system if the matrix (along with the sparsity level of the solution) satisfies a coherence-type condition. Numerical experiments indicate that the proposed algorithms are very promising and can quickly and accurately locate the sparse solution of a linear system with significantly fewer iterations than several mainstream iterative methods. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zhongfengsun.github.io/ . [Formula: see text]
- 10 October 2025
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 46 (4) , 2310-2330
Splitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into the two-block splitting alternating algorithm (TSAA) and the multiblock splitting alternating algorithm (MSAA). These algorithms aim to decompose a large-scale linear system into two or more coupled subsystems, each significantly smaller than the original system, and then combine the solutions of these subsystems to produce the sparse solution of the original system. The proposed algorithms only involve matrix-vector products and reduced orthogonal projections. It turns out that the proposed algorithms are globally convergent to the sparse solution of a linear system if the matrix (along with the sparsity level of the solution) satisfies a coherence-type condition. Numerical experiments indicate that the proposed algorithms are very promising and can quickly and accurately locate the sparse solution of a linear system with significantly fewer iterations than several mainstream iterative methods. Reproducibility of computational results. This paper has been awarded the “SIAM Reproducibility Badge: Code and data available” as a recognition that the authors have followed reproducibility principles valued by SIMAX and the scientific computing community. Code and data that allow readers to reproduce the results in this paper are available at https://zhongfengsun.github.io/ . [Formula: see text]
- Open Access
Compressed Newton-direction-based Thresholding Methods for Sparse Optimization Problems
Thresholding algorithms for sparse optimization problems involve two key components: search directions and thresholding strategies. In this paper, we use the compressed Newton direction as a search direction, derived by confining the classical Newton step to a low-dimensional subspace and embedding it back into the full space with diagonal regularization. This approach significantly reduces the computational cost for finding the search direction while maintaining the efficiency of Newton-like methods. Based on this new search direction, we propose two major classes of algorithms by adopting hard or optimal thresholding: the compressed Newton-direction-based thresholding pursuit (CNHTP) and compressed Newton-direction-based optimal thresholding pursuit (CNOTP). We establish the global convergence of the proposed algorithms under the restricted isometry property. Experimental results demonstrate that the proposed algorithms perform comparably to several state-of-the-art methods in terms of success frequency and solution accuracy for solving the sparse optimization problem.
Open AccessCompressed Newton-direction-based Thresholding Methods for Sparse Optimization Problems
Thresholding algorithms for sparse optimization problems involve two key components: search directions and thresholding strategies. In this paper, we use the compressed Newton direction as a search direction, derived by confining the classical Newton step to a low-dimensional subspace and embedding it back into the full space with diagonal regularization. This approach significantly reduces the computational cost for finding the search direction while maintaining the efficiency of Newton-like methods. Based on this new search direction, we propose two major classes of algorithms by adopting hard or optimal thresholding: the compressed Newton-direction-based thresholding pursuit (CNHTP) and compressed Newton-direction-based optimal thresholding pursuit (CNOTP). We establish the global convergence of the proposed algorithms under the restricted isometry property. Experimental results demonstrate that the proposed algorithms perform comparably to several state-of-the-art methods in terms of success frequency and solution accuracy for solving the sparse optimization problem.
- Open Access
Splitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into the two-block splitting alternating algorithm (TSAA) and the multi-block splitting alternating algorithm (MSAA). These algorithms aim to decompose a large-scale linear system into two or more coupled subsystems, each significantly smaller than the original system, and then combine the solutions of these subsystems to produce the sparse solution of the original system. The proposed algorithms only involve matrix-vector products and reduced orthogonal projections. It turns out that the proposed algorithms are globally convergent to the sparse solution of a linear system if the matrix (along with the sparsity level of the solution) satisfies a coherence-type condition. Numerical experiments indicate that the proposed algorithms are very promising and can quickly and accurately locate the sparse solution of a linear system with significantly fewer iterations than several mainstream iterative methods.
Open AccessSplitting Alternating Algorithms for Sparse Solutions of Linear Systems with Concatenated Orthogonal Matrices
A class of splitting alternating algorithms is proposed for finding the sparse solution of linear systems with concatenated orthogonal matrices. Depending on the number of matrices concatenated, the proposed algorithms are classified into the two-block splitting alternating algorithm (TSAA) and the multi-block splitting alternating algorithm (MSAA). These algorithms aim to decompose a large-scale linear system into two or more coupled subsystems, each significantly smaller than the original system, and then combine the solutions of these subsystems to produce the sparse solution of the original system. The proposed algorithms only involve matrix-vector products and reduced orthogonal projections. It turns out that the proposed algorithms are globally convergent to the sparse solution of a linear system if the matrix (along with the sparsity level of the solution) satisfies a coherence-type condition. Numerical experiments indicate that the proposed algorithms are very promising and can quickly and accurately locate the sparse solution of a linear system with significantly fewer iterations than several mainstream iterative methods.
- Open Access
- 3 January 2025
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 343
Data-time tradeoffs for optimal k-thresholding algorithms in quantized compressed sensing
松弛最优阈值(ROT)算法是压缩感知中的一种新的阈值技术, 用于从少量带噪线性测量中高效恢复稀疏信号, 克服了传统硬阈值算法由于残差函数振荡导致的缺点. 本文考虑一种新颖的数据时间权衡分析, 以说明在任何固定恢复精度下, 松弛最优阈值算法在压缩感知、量化压缩感知还原信号过程中测量数量和迭代次数之间的权衡. 理论结果还给出了在压缩感知、量化压缩感知中实现信号恢复所需的有效测量阶数. 最后, 通过数字实验也展示了ROT算法在稀疏重建问题中的数据时间权衡.
- 3 January 2025
- Published by Science China Press., Co. Ltd. in SCIENTIA SINICA Mathematica
- Vol. 55 (2) , 343
Open AccessData-time tradeoffs for optimal k-thresholding algorithms in quantized compressed sensing
松弛最优阈值(ROT)算法是压缩感知中的一种新的阈值技术, 用于从少量带噪线性测量中高效恢复稀疏信号, 克服了传统硬阈值算法由于残差函数振荡导致的缺点. 本文考虑一种新颖的数据时间权衡分析, 以说明在任何固定恢复精度下, 松弛最优阈值算法在压缩感知、量化压缩感知还原信号过程中测量数量和迭代次数之间的权衡. 理论结果还给出了在压缩感知、量化压缩感知中实现信号恢复所需的有效测量阶数. 最后, 通过数字实验也展示了ROT算法在稀疏重建问题中的数据时间权衡.
- 20 December 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (1) , 015004
Dynamic thresholding algorithm with memory for linear inverse problems
The relaxed optimal k-thresholding pursuit (ROTP) is a recent algorithm for linear inverse problems. This algorithm is based on the optimal k-thresholding technique which performs vector thresholding and error metric reduction simultaneously. Although ROTP can be used to solve small to medium-sized linear inverse problems, the computational cost of this algorithm is high when solving large-scale problems. By merging the optimal k-thresholding technique and iterative method with memory as well as optimization with sparse search directions, we propose the so-called dynamic thresholding algorithm with memory (DTAM), which iteratively and dynamically selects vector bases to construct the problem solution. At every step, the algorithm uses more than one or all iterates generated so far to construct a new search direction, and solves only the small-sized quadratic subproblems at every iteration. Thus the computational complexity of DTAM is remarkably lower than that of ROTP-type methods. It turns out that DTAM can locate the solution of linear inverse problems if the matrix involved satisfies the restricted isometry property. Experiments on synthetic data, audio signal reconstruction and image denoising demonstrate that the proposed algorithm performs comparably to several mainstream thresholding and greedy algorithms, and it works faster than the ROTP-type algorithms especially when the sparsity level of signal is relatively low.
- 20 December 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 41 (1) , 015004
Dynamic thresholding algorithm with memory for linear inverse problems
The relaxed optimal k-thresholding pursuit (ROTP) is a recent algorithm for linear inverse problems. This algorithm is based on the optimal k-thresholding technique which performs vector thresholding and error metric reduction simultaneously. Although ROTP can be used to solve small to medium-sized linear inverse problems, the computational cost of this algorithm is high when solving large-scale problems. By merging the optimal k-thresholding technique and iterative method with memory as well as optimization with sparse search directions, we propose the so-called dynamic thresholding algorithm with memory (DTAM), which iteratively and dynamically selects vector bases to construct the problem solution. At every step, the algorithm uses more than one or all iterates generated so far to construct a new search direction, and solves only the small-sized quadratic subproblems at every iteration. Thus the computational complexity of DTAM is remarkably lower than that of ROTP-type methods. It turns out that DTAM can locate the solution of linear inverse problems if the matrix involved satisfies the restricted isometry property. Experiments on synthetic data, audio signal reconstruction and image denoising demonstrate that the proposed algorithm performs comparably to several mainstream thresholding and greedy algorithms, and it works faster than the ROTP-type algorithms especially when the sparsity level of signal is relatively low.
- Open Access
Dynamic Thresholding Algorithm with Memory for Linear Inverse Problems
The relaxed optimal $k$-thresholding pursuit (ROTP) is a recent algorithm for linear inverse problems. This algorithm is based on the optimal $k$-thresholding technique which performs vector thresholding and error metric reduction simultaneously. Although ROTP can be used to solve small to medium-sized linear inverse problems, the computational cost of this algorithm is high when solving large-scale problems. By merging the optimal $k$-thresholding technique and iterative method with memory as well as optimization with sparse search directions, we propose the so-called dynamic thresholding algorithm with memory (DTAM), which iteratively and dynamically selects vector bases to construct the problem solution. At every step, the algorithm uses more than one or all iterates generated so far to construct a new search direction, and solves only the small-sized quadratic subproblems at every iteration. Thus the computational complexity of DTAM is remarkably lower than that of ROTP-type methods. It turns out that DTAM can locate the solution of linear inverse problems if the matrix involved satisfies the restricted isometry property. Experiments on synthetic data, audio signal reconstruction and image denoising demonstrate that the proposed algorithm performs comparably to several mainstream thresholding and greedy algorithms, and it works much faster than the ROTP-type algorithms especially when the sparsity level of signal is relatively low.
Open AccessDynamic Thresholding Algorithm with Memory for Linear Inverse Problems
The relaxed optimal $k$-thresholding pursuit (ROTP) is a recent algorithm for linear inverse problems. This algorithm is based on the optimal $k$-thresholding technique which performs vector thresholding and error metric reduction simultaneously. Although ROTP can be used to solve small to medium-sized linear inverse problems, the computational cost of this algorithm is high when solving large-scale problems. By merging the optimal $k$-thresholding technique and iterative method with memory as well as optimization with sparse search directions, we propose the so-called dynamic thresholding algorithm with memory (DTAM), which iteratively and dynamically selects vector bases to construct the problem solution. At every step, the algorithm uses more than one or all iterates generated so far to construct a new search direction, and solves only the small-sized quadratic subproblems at every iteration. Thus the computational complexity of DTAM is remarkably lower than that of ROTP-type methods. It turns out that DTAM can locate the solution of linear inverse problems if the matrix involved satisfies the restricted isometry property. Experiments on synthetic data, audio signal reconstruction and image denoising demonstrate that the proposed algorithm performs comparably to several mainstream thresholding and greedy algorithms, and it works much faster than the ROTP-type algorithms especially when the sparsity level of signal is relatively low.