Efficient dual ADMMs for sparse compressive sensing MRI reconstruction

DOI10.1007/S00186-023-00811-6zbMath1519.90168arXiv2111.12298MaRDI QIDQ6040852

Yun-hai Xiao, Hai-Bin Zhang, Peili Li, Yanyun Ding

Publication date: 22 May 2023

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2111.12298

zbMATH Keywords

magnetic resonance imagingalternating direction method of multiplierscompressive sensingnon-smooth convex minimizationsymmetric Gauss-Seidel iteration

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90)

Cites Work

• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• Image restoration: a wavelet frame based model for piecewise smooth functions and beyond
• An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
• Total variation wavelet inpainting
• An efficient algorithm for batch images alignment with adaptive rank-correction term
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
• An efficient algorithm for sparse inverse covariance matrix estimation based on dual formulation
• Symmetric Gauss-Seidel technique-based alternating direction methods of multipliers for transform invariant low-rank textures problem
• Two-step fixed-point proximity algorithms for multi-block separable convex problems
• Convergence analysis of tight framelet approach for missing data recovery
• A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications
• Hankel Matrix Rank Minimization with Applications to System Identification and Realization
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Monotone Operators and the Proximal Point Algorithm
• Convex Analysis
• Compressed sensing
• The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent
• A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions

This page was built for publication: Efficient dual ADMMs for sparse compressive sensing MRI reconstruction