Inverse problems with nonnegative and sparse solutions: algorithms and application to the phase retrieval problem
gradient-type algorithminverse problemsnonnegative and sparse solutionsnonnegative sparse regularizationphase retrieval problem
Nonsmooth analysis (49J52) Newton-type methods (49M15) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical optimization and variational techniques (65K10) Technical applications of optics and electromagnetic theory (78A55) Optimization problems in optics and electromagnetic theory (78M50) Methods of quasi-Newton type (90C53)
- 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
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A generalized conditional gradient method for nonlinear operator equations with sparsity constraints
- A semismooth Newton method for Tikhonov functionals with sparsity constraints
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Convergence rates and source conditions for Tikhonov regularization with sparsity constraints
- Convergence rates for Tikhonov regularization of a two-coefficient identification problem in an elliptic boundary value problem
- Convergence rates for total variation regularization of coefficient identification problems in elliptic equations. I.
- Convergence rates for total variation regularization of coefficient identification problems in elliptic equations. II
- Descent gradient methods for nonsmooth minimization problems in ill-posed problems
- Efficient schemes for total variation minimization under constraints in image processing
- Gradient descent for Tikhonov functionals with sparsity constraints: theory and numerical comparison of step size rules
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Learning the parts of objects by non-negative matrix factorization
- Mathematical problems in image processing. Partial differential equations and the calculus of variations. Foreword by Olivier Faugeras
- Necessary and sufficient conditions for linear convergence of ^1-regularization
- Non-convex sparse regularisation
- On the recovery of a 2-D function from the modulus of its Fourier transform
- Phase retrieval for imaging problems
- Reconstructing conductivity coefficients based on sparsity regularization and measured data in electrical impedance tomography
- Semismooth Newton and quasi-Newton methods in weighted ^1-regularization
- Semismooth Newton Methods for Operator Equations in Function Spaces
- Some first-order algorithms for total variation based image restoration
- Sparse regularization with l q penalty term
- Superlinear convergence of smoothing quasi-Newton methods for nonsmooth equations
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- \(l^1\)-weighted regularization for the problem of recovering sparse initial conditions in parabolic equations from final measurements
- A method for finding structured sparse solutions to nonnegative least squares problems with applications
- Variational Analysis Applied to the Problem of Optical Phase Retrieval
- Phase retrieval with sparse phase constraint
- The alternating descent conditional gradient method for sparse inverse problems
- Linear inverse problems with nonnegativity constraints: singularity of optimisers
- Convergence of proximal algorithms with stepsize controls for non-linear inverse problems and application to sparse non-negative matrix factorization
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)