General splitting methods with linearization for the split feasibility problem

DOI10.1007/s10898-020-00963-3OpenAlexW3096986282MaRDI QIDQ2022289

Songnian He, Qiao-Li Dong, Michael Th. Rassias

Publication date: 28 April 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00963-3

zbMATH Keywords

linear convergencesplit feasibility problemCQ algorithmrelaxed splitting method with linearizationthe general splitting method with linearization

Mathematics Subject Classification ID

Monotone operators and generalizations (47H05) Fixed-point theorems (47H10) Fixed-point and coincidence theorems (topological aspects) (54H25) Monotone and positive operators on ordered Banach spaces or other ordered topological vector spaces (47H07)

Related Items

A new iterative method with alternated inertia for the split feasibility problem, Modified relaxed CQ methods for the split feasibility problems in Hilbert spaces with applications, An alternated inertial general splitting method with linearization for the split feasibility problem, Two inertial-type algorithms for solving the split feasibility problem, Linearized Douglas-Rachford method for variational inequalities with Lipschitz mappings, The double-relaxation modulus-based matrix splitting iteration method for linear complementarity problems, A new inertial self-adaptive gradient algorithm for the split feasibility problem and an application to the sparse recovery problem, A dynamic simultaneous algorithm for solving split equality fixed point problems, A novel projection method for split feasibility problems with applications to compressive sensing, Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems, The iterative method for solving the proximal split feasibility problem with an application to LASSO problem, The strong convergence of Douglas-Rachford methods for the split feasibility problem, Multi-inertial parallel hybrid projection algorithm for generalized split null point problems

Cites Work

• Unnamed Item
• Unnamed Item
• Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
• Iterative methods for fixed point problems in Hilbert spaces
• Recent results on Douglas-Rachford methods for combinatorial optimization problems
• Solving proximal split feasibility problems without prior knowledge of operator norms
• An algorithm for a class of split feasibility problems: application to a model in electricity production
• ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• A multiprojection algorithm using Bregman projections in a product space
• Note on the modified relaxation CQ algorithm for the split feasibility problem
• Solving graph coloring problems with the Douglas-Rachford algorithm
• Peaceman-Rachford splitting for a class of nonconvex optimization problems
• Analysis on Newton projection method for the split feasibility problem
• An enhanced formulation for solving graph coloring problems with the Douglas-Rachford algorithm
• A cyclic Douglas-Rachford iteration scheme
• Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
• Double projection algorithms for solving the split feasibility problems
• On the Douglas-Rachford algorithm
• Polyak's gradient method for split feasibility problem constrained by level sets
• A parameterized Douglas-Rachford algorithm
• A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
• Global convergence of a non-convex Douglas-Rachford iteration
• Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
• On the local convergence of the Douglas-Rachford algorithm
• The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces
• Solving the split equality problem without prior knowledge of operator norms
• On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
• A Strictly Contractive Peaceman--Rachford Splitting Method for Convex Programming
• Self-adaptive projection methods for the multiple-sets split feasibility problem
• Solving the split feasibility problem without prior knowledge of matrix norms
• The Numerical Solution of Parabolic and Elliptic Differential Equations
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• Solving split equality fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operators norms
• A relaxed projection method for variational inequalities
• Splitting Algorithms for the Sum of Two Nonlinear Operators
• A unified treatment of some iterative algorithms in signal processing and image reconstruction
• Iterative oblique projection onto convex sets and the split feasibility problem
• Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
• Nonlinear iteration method for proximal split feasibility problems
• Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models
• Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
• Linear convergence of CQ algorithms and applications in gene regulatory network inference
• Convex analysis and monotone operator theory in Hilbert spaces