Pages that link to "Item:Q3138085"
From MaRDI portal
The following pages link to A Dual Approach to Linear Inverse Problems with Convex Constraints (Q3138085):
Displaying 14 items.
- Mann type iterative methods for finding a common solution of split feasibility and fixed point problems (Q270044) (← links)
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem (Q293116) (← links)
- The Mann-type extragradient iterative algorithms with regularization for solving variational inequality problems, split feasibility, and fixed point problems (Q369899) (← links)
- Relaxed extragradient methods with regularization for general system of variational inequalities with constraints of split feasibility and fixed point problems (Q370285) (← links)
- Proximity for sums of composite functions (Q536271) (← links)
- Dualization of signal recovery problems (Q618873) (← links)
- An extragradient method for solving split feasibility and fixed point problems (Q692301) (← links)
- A strongly convergent method for the split feasibility problem (Q695990) (← links)
- Some modified extragradient methods for solving split feasibility and fixed point problems (Q1938353) (← links)
- Relaxed and hybrid viscosity methods for general system of variational inequalities with split feasibility problem constraint (Q2436341) (← links)
- Duality and Convex Programming (Q2789804) (← links)
- Proximal Splitting Methods in Signal Processing (Q2897282) (← links)
- Multiplicative Algorithms for Maximum Penalized Likelihood Inversion with Non Negative Constraints and Generalized Error Distributions (Q5484670) (← links)
- The geometry of monotone operator splitting methods (Q6598417) (← links)
