Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems

DOI10.1002/mma.7931zbMath1527.47018OpenAlexW3214095207MaRDI QIDQ6179447

Bing Tan, Songxiao Li, Zheng Zhou

Publication date: 18 December 2023

Published in: Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mma.7931

zbMATH Keywords

strong convergencesignal recoveryhybrid steepest descent methodadaptive step sizeinertial technique

Mathematics Subject Classification ID

Convex programming (90C25) Numerical optimization and variational techniques (65K10) Iterative procedures involving nonlinear operators (47J25) Numerical algorithms for specific classes of architectures (65Y10) Variational and other types of inclusions (47J22)

Related Items (1)

Relaxed double inertial Tseng's extragradient method for solving non-Lipschitz split monotone variational inclusion problems with fixed point constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the variational inequality problem defined on intersection of finite level sets
• Split monotone variational inclusions
• Algorithms for the split variational inequality problem
• A general iterative algorithm for nonexpansive mappings in Hilbert spaces
• A multiprojection algorithm using Bregman projections in a product space
• Convergence of a splitting inertial proximal method for monotone operators
• Viscosity approximation methods for fixed-points problems
• New inertial relaxed method for solving split feasibilities
• A self adaptive inertial algorithm for solving split variational inclusion and fixed point problems with applications
• Fixed points of nonlinear operators. Iterative methods
• A new accelerated self-adaptive stepsize algorithm with excellent stability for split common fixed point problems
• A new inertial double-projection method for solving variational inequalities
• Strong convergence of extragradient methods for solving bilevel pseudo-monotone variational inequality problems
• A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
• A general iterative method for nonexpansive mappings in Hilbert spaces
• Strong convergence of self-adaptive inertial algorithms for solving split variational inclusion problems with applications
• Solving the split feasibility problem without prior knowledge of matrix norms
• SELF ADAPTIVE VISCOSITY-TYPE INERTIAL EXTRAGRADIENT ALGORITHMS FOR SOLVING VARIATIONAL INEQUALITIES WITH APPLICATIONS
• 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 Split Common Null Point Problem
• A method with inertial extrapolation step for split monotone inclusion problems
• An accelerated hybrid projection method with a self‐adaptive step‐size sequence for solving split common fixed point problems
• An inertial method for solving generalized split feasibility problems over the solution set of monotone variational inclusions
• Strong convergence of inertial Mann algorithms for solving hierarchical fixed point problems
• A Geometrical Look at Iterative Methods for Operators with Fixed Points
• A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
• 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: Adaptive hybrid steepest descent algorithms involving an inertial extrapolation term for split monotone variational inclusion problems