Operations Research Transactions ›› 2025, Vol. 29 ›› Issue (2): 158-174.doi: 10.15960/j.cnki.issn.1007-6093.2025.02.012

• Research Article • Previous Articles     Next Articles

A variable metric extrapolation hard threshold algorithm for some linear inverse problem

Yuru ZHANG1, Xue ZHANG1,*(), Ru LAN1   

  1. School of Mathematics and Computer Science, Shanxi Normal University, Taiyuan 030031, Shanxi, China
  • Received:2022-04-27 Online:2025-06-15 Published:2025-06-12
  • Contact: Xue ZHANG E-mail:zhangxue2100442@163.com

Abstract:

Sparsity regularization model is widely used in inverse problems such as signal and image processing. This paper mainly focuses on the linear least squares $\ell_0$ minimization problem coming from linear inverse problems. Extrapolation forward-backward splitting algorithm is one of the most popular solving methods. If the iteration number is sufficiently large, the non-zero index set of iteration point remains unchanged. Then extrapolation forward-backward splitting algorithm methods is equivalent to solving the problem $\min\limits_{x\in C} f(x)$ where $C$ is some linear subspace related to iteration points. On the other hand, variable metric type method can reach fast performance in practice. Encouraged by these, we employ the fast convergent quasi Newton method into the extrapolation step, and then propose a block variable metric extrapolation algorithm. Meanwhile, its convergence, linear convergence rate and superlinear convergence rate are studied. Finally, numerical experiments show the effectiveness and fast-speed of the proposed algorithm.

Key words: block, variable metric, extrapolation, linear convergence rate, super-linear convergence rate, ?0 regularization

CLC Number: