Pages that link to "Item:Q1725206"
From MaRDI portal
The following pages link to A regularized algorithm for the proximal split feasibility problem (Q1725206):
Displaying 16 items.
- General viscosity iterative approximation for solving unconstrained convex optimization problems (Q262689) (← links)
- The split Bregman algorithm applied to PDE-constrained optimization problems with total variation regularization (Q301680) (← links)
- Alternating proximal penalization algorithm for the modified multiple-sets split feasibility problems (Q1633801) (← links)
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method (Q1684866) (← links)
- A note on approximating curve with 1-norm regularization method for the split feasibility problem (Q1760799) (← links)
- New inertial proximal gradient methods for unconstrained convex optimization problems (Q2069605) (← links)
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection (Q2200085) (← links)
- An iterative method for solving proximal split feasibility problems and fixed point problems (Q2326919) (← links)
- (Q4607743) (← links)
- Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems (Q4639143) (← links)
- An iterative method for solution of finite families of split minimization problems and fixed point problems (Q4985303) (← links)
- A method with inertial extrapolation step for split monotone inclusion problems (Q4986401) (← links)
- (Q5073293) (← links)
- Bounded perturbation resilience and superiorization techniques for a modified proximal gradient method (Q5110322) (← links)
- (Q5121087) (← links)
- Strong convergence algorithm for proximal split feasibility problem (Q6621082) (← links)
