A Convexly Constrained LiGME Model and Its Proximal Splitting Algorithm

For the sparsity-rank-aware least squares estimations, the LiGME (Linearly involved Generalized Moreau Enhanced) model was established recently in [Abe, Yamagishi, Yamada, 2020] to use certain nonconvex enhancements of linearly involved convex regularizers without losing their overall convexities. In this paper, for further advancement of the LiGME model by incorporating multiple a priori knowledge as hard convex constraints, we newly propose a convexly constrained LiGME (cLiGME) model. The cLiGME model can utilize multiple convex constraints while preserving benefits achieved by the LiGME model. We also present a proximal splitting type algorithm for the proposed cLiGME model. Numerical experiments demonstrate the efficacy of the proposed model and the proposed optimization algorithm in a scenario of signal processing application.

[1]  Cun-Hui Zhang.  Nearly unbiased variable selection under minimax concave penalty , 2010, 1002.4734.

[2]  Charles Soussen,et al.  NP-hardness of ℓ0 minimization problems: revision and extension to the non-negative setting , 2019, 2019 13th International conference on Sampling Theory and Applications (SampTA).

[3]  Balas K. Natarajan,et al.  Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..

[4]  Tsuyoshi Murata,et al.  {m , 1934, ACML.

[5]  Sergios Theodoridis,et al.  Machine Learning: A Bayesian and Optimization Perspective , 2015 .

[6]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[7]  Ivan Selesnick,et al.  Stable Principal Component Pursuit via Convex Analysis , 2019, IEEE Transactions on Signal Processing.

[8]  Mila Nikolova,et al.  Energy Minimization Methods , 2015, Handbook of Mathematical Methods in Imaging.

[9]  Fionn Murtagh,et al.  Sparse Image and Signal Processing: Wavelets and Related Geometric Multiscale Analysis, Second Edition , 2015 .

[10]  R. Tibshirani.  Regression Shrinkage and Selection via the Lasso , 1996 .

[11]  Masao Yamagishi,et al.  Linearly Involved Generalized Moreau Enhanced Models and Their Proximal Splitting Algorithm under Overall Convexity Condition , 2019, ArXiv.

[12]  Mila Nikolova,et al.  Markovian reconstruction using a GNC approach , 1999, IEEE Trans. Image Process..

[13]  S. Frick,et al.  Compressed Sensing , 2014, Computer Vision, A Reference Guide.

[14]  Y. Censor,et al.  Parallel Optimization:theory , 1997 .

[15]  I. Daubechies,et al.  An iterative thresholding algorithm for linear inverse problems with a sparsity constraint , 2003, math/0307152.

[16]  Ivan W. Selesnick,et al.  Sparse Regularization via Convex Analysis , 2017, IEEE Transactions on Signal Processing.

[17]  B. Frieden,et al.  Image recovery: Theory and application , 1987, IEEE Journal of Quantum Electronics.

[18]  P. L. Combettes,et al.  Foundation of set theoretic estimation , 1993 .

[19]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[20]  M. Nikolova,et al.  Estimation of binary images by minimizing convex criteria , 1998, Proceedings 1998 International Conference on Image Processing. ICIP98 (Cat. No.98CB36269).

[21]  Deepa Kundur,et al.  A novel blind deconvolution scheme for image restoration using recursive filtering , 1998, IEEE Trans. Signal Process..

[22]  E. Candès,et al.  Stable signal recovery from incomplete and inaccurate measurements , 2005, math/0503066.

[23]  L. Rudin,et al.  Nonlinear total variation based noise removal algorithms , 1992 .

[24]  Gabor T. Herman,et al.  Image Reconstruction From Projections , 1975, Real Time Imaging.

[25]  Andrew Blake,et al.  Visual Reconstruction , 1987, Deep Learning for EEG-Based Brain–Computer Interfaces.

[26]  D. Youla,et al.  Image Restoration by the Method of Convex Projections: Part 1ߞTheory , 1982, IEEE Transactions on Medical Imaging.