A kind of ill-posed inverse problem solving with sparsity constraint

MaRDI QIDQ2991708zbMATH OpenFDO

Authors Yu-Juan Zhao, Baoyu Zheng, Shouning Chen

Publication date 10 August 2016

zbMATH Keywords

ill-posed inverse problemmatrix completionreconstruction algorithmsparsity constraint

Mathematics Subject Classification ID

Inverse problems in linear algebra (15A29) Matrix completion problems (15A83) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Recommendations

• Matrix completion with sparse measurement errors
• Low-rank matrix completion by Riemannian optimization
• Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm
• Nuclear norm regularization with a low-rank constraint for matrix completion
• Sparse recovery in inverse problems

Cited in

(6)

• A new iterative firm-thresholding algorithm for inverse problems with sparsity constraints
• Sparsity of solutions for variational inverse problems with finite-dimensional data
• TV-min and greedy pursuit for constrained joint sparsity and application to inverse scattering
• COLLAGE-BASED INVERSE PROBLEMS FOR IFSM WITH ENTROPY MAXIMIZATION AND SPARSITY CONSTRAINTS
• An iterative thresholding-like algorithm for inverse problems with sparsity constraints in Banach space
• Domain decomposition methods for linear inverse problems with sparsity constraints

This page was built for publication: A kind of ill-posed inverse problem solving with sparsity constraint

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2991708)