Global and linear convergence of alternated inertial methods for split feasibility problems
DOI10.1007/s13398-020-00979-0OpenAlexW3119103424MaRDI QIDQ2222846
Lulu Liu, Yekini Shehu, Qiao-Li Dong
Publication date: 27 January 2021
Published in: Revista de la Real Academia de Ciencias Exactas, Físicas y Naturales. Serie A: Matemáticas. RACSAM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13398-020-00979-0
Convex programming (90C25) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Numerical methods for variational inequalities and related problems (65K15)
Related Items (9)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems
- Extra-gradient methods for solving split feasibility and fixed point problems
- Inertial Douglas-Rachford splitting for monotone inclusion problems
- An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
- Cyclic algorithms for split feasibility problems in Hilbert spaces
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Inertial iterative process for fixed points of certain quasi-nonexpansive mappings
- An inertial forward-backward algorithm for monotone inclusions
- An iterative row-action method for interval convex programming
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
- A fixed point method for solving a split feasibility problem in Hilbert spaces
- On the proximal gradient algorithm with alternated inertia
- Convergence of a splitting inertial proximal method for monotone operators
- Cournot-Nash and Bertrand-Nash equilibria for a heterogeneous duopoly of differentiated products
- A self-adaptive projection method with an inertial technique for split feasibility problems in Banach spaces with applications to image restoration problems
- New inertial relaxed method for solving split feasibilities
- A simple look at the method for solving split feasibility problems in Hilbert spaces
- Several inertial methods for solving split convex feasibilities and related problems
- Projection methods with alternating inertial steps for variational inequalities: weak and linear convergence
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems
- Double projection algorithms for solving the split feasibility problems
- Inertial accelerated algorithms for solving a split feasibility problem
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- An inertial alternating direction method of multipliers
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- The strong convergence of a KM–CQ-like algorithm for a split feasibility problem
- Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
- Solving the split feasibility problem without prior knowledge of matrix norms
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- An iterative regularization method for the solution of the split feasibility problem in Banach spaces
- A relaxed projection method for variational inequalities
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- Spatial Oligopolistic Electricity Models with Cournot Generators and Regulated Transmission Prices
- A First-Order Primal-Dual Algorithm with Linesearch
- A generic online acceleration scheme for optimization algorithms via relaxation and inertia
- The ball-relaxed CQ algorithms for the split feasibility problem
- On Projection Algorithms for Solving Convex Feasibility Problems
- The relaxed CQ algorithm solving the split feasibility problem
- A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
- Two projection algorithms for a class of split feasibility problems with jointly constrained Nash equilibrium models
- Extragradient and linesearch methods for solving split feasibility problems in Hilbert spaces
- Linear convergence of CQ algorithms and applications in gene regulatory network inference
- Hybrid inertial proximal algorithm for the split variational inclusion problem in Hilbert spaces with applications
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: Global and linear convergence of alternated inertial methods for split feasibility problems