On inertial non-Lipschitz stepsize algorithms for split feasibility problems
From MaRDI portal
Recommendations
- Inertial relaxed CQ algorithm for split feasibility problems with non-Lipschitz gradient operators
- Two inertial-type algorithms for solving the split feasibility problem
- New inertial relaxed CQ algorithms for solving split feasibility problems in Hilbert spaces
- Alternated inertial algorithms for split feasibility problems
- Convergence analysis of a new relaxed algorithm with inertial for solving split feasibility problems
Cites work
- ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
- A self-adaptive projection method for solving the multiple-sets split feasibility problem
- A subgradient algorithm for a class of nonlinear split feasibility problems: application to jointly constrained Nash equilibrium models
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An implementable splitting algorithm for the _1-norm regularized split feasibility problem
- An inertial Halpern-type CQ algorithm for solving split feasibility problems in Hilbert spaces
- An inertial proximal method for maximal monotone operators via discretization of a nonlinear oscillator with damping
- An inertial triple-projection algorithm for solving the split feasibility problem
- An MM Algorithm for Split Feasibility Problems
- An optimization approach to solving the split feasibility problem in Hilbert spaces
- Analysis on Newton projection method for the split feasibility problem
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- Convex analysis and monotone operator theory in Hilbert spaces
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Fast convex optimization via inertial dynamics with Hessian driven damping
- Fixed Point Theory for Lipschitzian-type Mappings with Applications
- General splitting methods with linearization for the split feasibility problem
- Global and linear convergence of alternated inertial methods for split feasibility problems
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration
- Inertial projection-type methods for solving pseudomonotone variational inequality problems in Hilbert space
- Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces
- Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- New inertial relaxed method for solving split feasibilities
- Note on the modified relaxation CQ algorithm for the split feasibility problem
- On descent-projection method for solving the split feasibility problems
- On inertial proximal algorithm for split variational inclusion problems
- On the convergence analysis of the gradient-CQ algorithms for the split feasibility problem
- On variable-step relaxed projection algorithm for variational inequalities
- Self-adaptive projection methods for the multiple-sets split feasibility problem
- Solving the split feasibility problem without prior knowledge of matrix norms
- Some methods of speeding up the convergence of iteration methods
- The ball-relaxed CQ algorithms for the split feasibility problem
- The iterative method for solving the proximal split feasibility problem with an application to LASSO problem
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2
- Weak and strong convergence theorems for fixed points of asymptotically nonexpansive mappings
- Weak Convergence of a Relaxed and Inertial Hybrid Projection-Proximal Point Algorithm for Maximal Monotone Operators in Hilbert Space
- Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces
This page was built for publication: On inertial non-Lipschitz stepsize algorithms for split feasibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623470)
