Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
DOI10.1088/1361-6420/AAB6C9zbMATH Open1393.78014OpenAlexW2793508829WikidataQ130122446 ScholiaQ130122446MaRDI QIDQ4569355FDOQ4569355
Pham Quy Muoi, Dinh Nho Hào, Nguyen Huu Cong, Cuong Dang, Sujit Kumar Sahoo, Dongliang Tang
Publication date: 28 June 2018
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10356/106501
Recommendations
- On the role of sparsity in inverse problems
- Phase retrieval with sparse phase constraint
- Accelerated projected steepest descent method for nonlinear inverse problems with sparsity constraints
- Sparse recovery in inverse problems
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
inverse problemsphase retrieval problemnonnegative sparse regularizationgradient-type algorithmnonnegative and sparse solutions
Numerical optimization and variational techniques (65K10) Ill-posedness and regularization problems in numerical linear algebra (65F22) Technical applications of optics and electromagnetic theory (78A55) Methods of quasi-Newton type (90C53) Nonsmooth analysis (49J52) Newton-type methods (49M15) Optimization problems in optics and electromagnetic theory (78M50)
Cites Work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Phase retrieval for imaging problems
- Learning the parts of objects by non-negative matrix factorization
- Necessary and sufficient conditions for linear convergence of ℓ1-regularization
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Title not available (Why is that?)
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Gradient descent for Tikhonov functionals with sparsity constraints: theory and numerical comparison of step size rules
- Semismooth Newton and quasi-Newton methods in weighted \(\ell^1\)-regularization
- Convergence rates for total variation regularization of coefficient identification problems in elliptic equations I
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- Sparse regularization with l q penalty term
- Convergence rates for total variation regularization of coefficient identification problems in elliptic equations. II
- Convergence rates for Tikhonov regularization of a two-coefficient identification problem in an elliptic boundary value problem
- Efficient Schemes for Total Variation Minimization Under Constraints in Image Processing
- Non-convex sparse regularisation
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Some first-order algorithms for total variation based image restoration
- Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations
- Reconstructing conductivity coefficients based on sparsity regularization and measured data in electrical impedance tomography
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- On the recovery of a 2-D function from the modulus of its Fourier transform
Cited In (3)
- Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
- Variational Analysis Applied to the Problem of Optical Phase Retrieval
- \(l^1\)-weighted regularization for the problem of recovering sparse initial conditions in parabolic equations from final measurements
Uses Software
This page was built for publication: Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569355)