The following pages link to Meng Wen (Q373610):
Displayed 29 items.
- Strong convergence of an new iterative method for a zero of accretive operator and nonexpansive mapping (Q373612) (← links)
- A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem (Q495732) (← links)
- Sparse signals recovered by non-convex penalty in quasi-linear systems (Q824479) (← links)
- Iterative thresholding algorithm based on non-convex method for modified \(l_p\)-norm regularization minimization (Q1631426) (← links)
- Strong convergence of some algorithms for \(\lambda \)-strict pseudo-contractions in Banach spaces (Q1689697) (← links)
- Convergence of implicit and explicit schemes for an asymptotically nonexpansive mapping in \(q\)-uniformly smooth and strictly convex Banach spaces (Q1760700) (← links)
- A preconditioning technique for first-order primal-dual splitting method in convex optimization (Q1992653) (← links)
- Convergence of an explicit scheme for nonexpansive semigroups in Banach spaces (Q2000705) (← links)
- Efficient primal-dual fixed point algorithms with dynamic stepsize for composite convex optimization problems (Q2002421) (← links)
- Algorithms for finding a common element of the set of common fixed points for nonexpansive semigroups, variational inclusions and generalized equilibrium problems (Q2006811) (← links)
- Preconditioned Douglas-Rachford type primal-dual method for solving composite monotone inclusion problems with applications (Q2047289) (← links)
- Iterative methods for obtaining an infinite family of strict pseudo-contractions in Banach spaces (Q2161512) (← links)
- A splitting primal-dual proximity algorithm for solving composite optimization problems (Q2404000) (← links)
- Iterative approximation of zeros of accretive operators and of solutions to fixed point problems in \(q\)-uniformly smooth Banach spaces (Q2409484) (← links)
- Preconditioned three-operator splitting algorithm with applications to image restoration (Q2674258) (← links)
- (Q3389140) (← links)
- (Q5173639) (← links)
- (Q5257319) (← links)
- An inertial primal‐dual fixed point algorithm for composite optimization problems (Q6149155) (← links)
- A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems (Q6157934) (← links)
- A stochastic coordinate descent primal-dual algorithm with dynamic stepsize for large-scale composite optimization (Q6272523) (← links)
- A stochastic coordinate descent splitting primal-dual fixed point algorithm and applications to large-scale composite optimization (Q6272539) (← links)
- A stochastic coordinate descent inertial primal-dual algorithm for large-scale composite optimization (Q6272605) (← links)
- Efficient primal-dual fixed point algorithm with dynamic stepsize for convex problems with applications to imaging restoration (Q6272606) (← links)
- A randomized intertial primal-dual fixed point algorithm for monotone inclusions (Q6279801) (← links)
- Recovering Sparse Nonnegative Signals via Non-convex Fraction Function Penalty (Q6289247) (← links)
- Sparse Portfolio Selection via Non-convex Fraction Function (Q6297015) (← links)
- A New Nonconvex Strategy to Affine Matrix Rank Minimization Problem (Q6300966) (← links)
- Nonconvex fraction function recovery sparse signal by convex optimization algorithm (Q6318684) (← links)