Pages that link to "Item:Q3086010"

The following pages link to Self-adaptive projection methods for the multiple-sets split feasibility problem (Q3086010):

Displaying 49 items.

• A simple algorithm for computing projection onto intersection of finite level sets (Q260148) (← links)
• Hybrid CQ projection algorithm with line-search process for the split feasibility problem (Q267698) (← links)
• Algorithmic and analytical approach to the split common fixed points problem (Q286569) (← links)
• Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size (Q288176) (← links)
• Hybrid simultaneous algorithms for the split equality problem with applications (Q308169) (← links)
• Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints (Q401850) (← links)
• Strong convergence theorems for the split variational inclusion problem in Hilbert spaces (Q402500) (← links)
• Applications of fixed-point and optimization methods to the multiple-set split feasibility problem (Q443134) (← links)
• Several acceleration schemes for solving the multiple-sets split feasibility problem (Q445822) (← links)
• Modified alternating direction methods for the modified multiple-sets split feasibility problems (Q467474) (← links)
• A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem (Q495732) (← links)
• ``Optimal'' choice of the step length of the projection and contraction methods for solving the split feasibility problem (Q721148) (← links)
• Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem'' (Q747730) (← links)
• Bounded perturbation resilience of extragradient-type methods and their applications (Q1677995) (← links)
• An algorithm for the split-feasibility problems with application to the split-equality problem (Q1684620) (← links)
• A parallel method for variational inequalities with the multiple-sets split feasibility problem constraints (Q1684880) (← links)
• An explicit method for the split feasibility problem with self-adaptive step sizes (Q1938197) (← links)
• Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem (Q1938343) (← links)
• Two-step methods and relaxed two-step methods for solving the split equality problem (Q1983935) (← links)
• General splitting methods with linearization for the split feasibility problem (Q2022289) (← links)
• A Levenberg-Marquardt method for solving the tensor split feasibility problem (Q2059189) (← links)
• An inertial extrapolation method for multiple-set split feasibility problem (Q2069587) (← links)
• The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem (Q2072995) (← links)
• The strong convergence of Douglas-Rachford methods for the split feasibility problem (Q2080607) (← links)
• An inertial triple-projection algorithm for solving the split feasibility problem (Q2097467) (← links)
• Strong convergence of a self-adaptive method for the split feasibility problem (Q2253220) (← links)
• A family of projection gradient methods for solving the multiple-sets split feasibility problem (Q2275325) (← links)
• Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems (Q2314650) (← links)
• New inertial method for generalized split variational inclusion problems (Q2666728) (← links)
• A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem (Q2808325) (← links)
• A simple projection method for solving the multiple-sets split feasibility problem (Q2872701) (← links)
• A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem (Q2929511) (← links)
• Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems (Q3188534) (← links)
• (Q3384735) (← links)
• Ball-relaxed projection algorithms for multiple-sets split feasibility problem (Q5045171) (← links)
• A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem (Q5052602) (← links)
• Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee (Q5088832) (← links)
• New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space (Q5089337) (← links)
• Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces (Q5236148) (← links)
• Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications (Q5420198) (← links)
• (Q5858976) (← links)
• The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems (Q6099522) (← links)
• An approximate gradient-type method for nonlinear symmetric equations with convex constraints (Q6137785) (← links)
• A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem (Q6145664) (← links)
• New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem (Q6158077) (← links)
• A novel projection method for split feasibility problems with applications to compressive sensing (Q6159820) (← links)
• Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery (Q6160613) (← links)
• Projection algorithms with adaptive step sizes for multiple output split mixed variational inequality problems (Q6602313) (← links)
• On inertial non-Lipschitz stepsize algorithms for split feasibility problems (Q6623470) (← links)