A Dual Approach to Linear Inverse Problems with Convex Constraints
From MaRDI portal
Publication:3138085
DOI10.1137/0331049zbMATH Open0797.49019OpenAlexW2024855591MaRDI QIDQ3138085FDOQ3138085
Publication date: 6 December 1993
Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0331049
Recommendations
- Iteratively solving linear inverse problems under general convex constraints
- scientific article; zbMATH DE number 2059559
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Convexly constrained linear inverse problems: Iterative least-squares and regularization
- A dual approach to constrained interpolation from a convex subset of Hilbert space
Cited In (18)
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems
- Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems
- An extragradient method for solving split feasibility and fixed point problems
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- The geometry of monotone operator splitting methods
- Iteratively solving linear inverse problems under general convex constraints
- On extending the orthogonality property of minimum norm solutions in Hilbert space to general methods for linear inverse problems
- Proximal Splitting Methods in Signal Processing
- Relaxed and hybrid viscosity methods for general system of variational inequalities with split feasibility problem constraint
- Some modified extragradient methods for solving split feasibility and fixed point problems
- Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions
- A strongly convergent method for the split feasibility problem
- Dualization of signal recovery problems
- Convexly constrained linear inverse problems: Iterative least-squares and regularization
- The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems
- Linear reconstruction problems with convex constraints: Influence of the a priori data
- Proximity for sums of composite functions
- Duality and Convex Programming
This page was built for publication: A Dual Approach to Linear Inverse Problems with Convex Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138085)
