scientific article; zbMATH DE number 7525859

zbMath1498.47124MaRDI QIDQ5075972

No author found.

Publication date: 12 May 2022

Full work available at URL: http://www.math.md/publications/basm/issues/y2021-n1-2/13356/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Banach spacesstrong convergenceinverse problemsfixed point problemssplit feasibility problemsBregman distanceproximal operatorssoft thresholdingsplit minimization problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Nonlinear accretive operators, dissipative operators, etc. (47H06) Iterative procedures involving nonlinear operators (47J25) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)

Cites Work

• An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
• Self-adaptive algorithms for proximal split feasibility problems and strong convergence analysis
• An iterative algorithm for solving split feasibility problems and fixed point problems in Banach spaces
• An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
• Regularized methods for the split feasibility problem
• Right Bregman nonexpansive operators in Banach spaces
• Solving proximal split feasibility problems without prior knowledge of operator norms
• Further investigation into approximation of a common solution of fixed point problems and split feasibility problems
• Accelerated projected gradient method for linear inverse problems with sparsity constraints
• Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
• Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
• Proximal point algorithms and four resolvents of nonlinear operators of monotone type in Banach spaces
• An iterative row-action method for interval convex programming
• A multiprojection algorithm using Bregman projections in a product space
• Convergence analysis for the proximal split feasibility problem using an inertial extrapolation term method
• Iterative methods for solving proximal split minimization problems
• Bregman strongly nonexpansive operators in reflexive Banach spaces
• Strong convergence theorems for finite families of pseudomonotone equilibrium and fixed point problems in Banach spaces
• Inertial shrinking projection algorithm with self-adaptive step size for split generalized equilibrium and fixed point problems for a countable family of nonexpansive multivalued mappings
• An iterative algorithm for solving variational inequality, generalized mixed equilibrium, convex minimization and zeros problems for a class of nonexpansive-type mappings
• A strong convergence theorem for solving pseudo-monotone variational inequalities using projection methods
• Two modifications of the inertial Tseng extragradient method with self-adaptive step size for solving monotone variational inequality problems
• Inertial-type algorithm for solving split common fixed point problems in Banach spaces
• A unified algorithm for solving variational inequality and fixed point problems with application to the split equality problem
• Convergence analysis for proximal split feasibility problems and fixed point problems
• New generalized variable stepsizes of the CQ algorithm for solving the split feasibility problem
• A parallel combination extragradient method with Armijo line searching for finding common solutions of finite families of equilibrium and fixed point problems
• Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces
• A new inertial-projection algorithm for approximating common solution of variational inequality and fixed point problems of multivalued mappings
• The split common null point problem and the shrinking projection method in Banach spaces
• Iterative methods for the split feasibility problem in infinite-dimensional Hilbert spaces
• Matrix p-Norms Are NP-Hard to Approximate If $p\neq1,2,\infty$
• Iterative Algorithms for Nonlinear Operators
• 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
• Inequalities in Banach spaces with applications
• Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
• Bregman Monotone Optimization Algorithms
• 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 relaxed CQ algorithm solving the split feasibility problem
• Modified inertial subgradient extragradient method with self adaptive stepsize for solving monotone variational inequality and fixed point problems
• Inertial algorithm with self-adaptive step size for split common null point and common fixed point problems for multivalued mappings in Banach spaces
• Inertial extragradient method via viscosity approximation approach for solving equilibrium problem in Hilbert space
• Convergence analysis of an iterative method for solving multiple-set split feasibility problems in certain Banach spaces

This page was built for publication: