Self-adaptive projection methods for the multiple-sets split feasibility problem
From MaRDI portal
Publication:3086010
DOI10.1088/0266-5611/27/3/035009zbMath1215.65115OpenAlexW2092649018MaRDI QIDQ3086010
Publication date: 29 March 2011
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/0266-5611/27/3/035009
convergencenumerical resultsmultiple-sets split feasibility problemArmijo-like searchesSelf-adaptive projection methods
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items
Hybrid CQ projection algorithm with line-search process for the split feasibility problem ⋮ Algorithmic and analytical approach to the split common fixed points problem ⋮ Iterative methods for solving the multiple-sets split feasibility problem with splitting self-adaptive step size ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem ⋮ Hybrid simultaneous algorithms for the split equality problem with applications ⋮ Some subgradient extragradient type algorithms for solving split feasibility and fixed point problems ⋮ A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ New Self-Adaptive Algorithms and Inertial Self-Adaptive Algorithms for the Split Variational Inclusion Problems in Hilbert Space ⋮ New inertial method for generalized split variational inclusion problems ⋮ Bounded perturbation resilience of extragradient-type methods and their applications ⋮ Unnamed Item ⋮ An algorithm for the split-feasibility problems with application to the split-equality problem ⋮ A parallel method for variational inequalities with the multiple-sets split feasibility problem constraints ⋮ Hierarchical problems with applications to mathematical programming with multiple sets split feasibility constraints ⋮ Strong convergence theorems for the split variational inclusion problem in Hilbert spaces ⋮ The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems ⋮ An explicit method for the split feasibility problem with self-adaptive step sizes ⋮ Self-adaptive and relaxed self-adaptive projection methods for solving the multiple-set split feasibility problem ⋮ An approximate gradient-type method for nonlinear symmetric equations with convex constraints ⋮ A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem ⋮ New hybrid inertial CQ projection algorithms with line-search process for the split feasibility problem ⋮ A novel projection method for split feasibility problems with applications to compressive sensing ⋮ Second order self-adaptive dynamical system for sparse signal reconstruction and applications to image recovery ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ Several acceleration schemes for solving the multiple-sets split feasibility problem ⋮ Unnamed Item ⋮ Modified alternating direction methods for the modified multiple-sets split feasibility problems ⋮ A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem ⋮ Two-step methods and relaxed two-step methods for solving the split equality problem ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications ⋮ General splitting methods with linearization for the split feasibility problem ⋮ A family of projection gradient methods for solving the multiple-sets split feasibility problem ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem ⋮ Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem ⋮ A Levenberg-Marquardt method for solving the tensor split feasibility problem ⋮ Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces ⋮ The inertial relaxed algorithm with Armijo-type line search for solving multiple-sets split feasibility problem ⋮ The strong convergence of Douglas-Rachford methods for the split feasibility problem ⋮ An inertial triple-projection algorithm for solving the split feasibility problem ⋮ A simple projection method for solving the multiple-sets split feasibility problem ⋮ A simple algorithm for computing projection onto intersection of finite level sets
