On inertial non-Lipschitz stepsize algorithms for split feasibility problems
From MaRDI portal
Publication:6623470
DOI10.1007/s40314-024-02922-0MaRDI QIDQ6623470
Publication date: 24 October 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
weak convergenceconvergence ratesplit feasibility probleminertial CQ approachnon-Lipschitz stepsize strategy
Variational and other types of inequalities involving nonlinear operators (general) (47J20) Variational inequalities (49J40) Iterative procedures involving nonlinear operators (47J25) Variational methods applied to PDEs (35A15)
Cites Work
- Unnamed Item
- An MM Algorithm for Split Feasibility Problems
- An implementable splitting algorithm for the \(\ell_1\)-norm regularized split feasibility problem
- Fast convex optimization via inertial dynamics with Hessian driven damping
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- Inertial projection-type methods for solving pseudomonotone variational inequality problems in Hilbert space
- A multiprojection algorithm using Bregman projections in a product space
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- On variable-step relaxed projection algorithm for variational inequalities
- On descent-projection method for solving the split feasibility problems
- Analysis on Newton projection method for the split feasibility problem
- General splitting methods with linearization for the split feasibility problem
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- New inertial relaxed method for solving split feasibilities
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
- An inertial triple-projection algorithm for solving the split feasibility problem
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Global and linear convergence of alternated inertial methods for split feasibility problems
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Iterative oblique projection onto convex sets and the split feasibility problem
- The ball-relaxed CQ algorithms for the split feasibility problem
- On inertial proximal algorithm for split variational inclusion problems
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- Some methods of speeding up the convergence of iteration methods
- Convex analysis and monotone operator theory in Hilbert spaces
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
This page was built for publication: On inertial non-Lipschitz stepsize algorithms for split feasibility problems