Parallel proximal method of solving split system of fixed point set constraint minimization problems
DOI10.1007/s13398-019-00758-6OpenAlexW2991967746MaRDI QIDQ2293112
Rabian Wangkeeree, Anteneh Getachew Gebrie
Publication date: 6 February 2020
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-019-00758-6
minimization problemsfixed pointsplit feasibility problemMoreau-Yosida approximate\( \kappa \)-strictly pseudocontractive mapping
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Set-valued and variational analysis (49J53) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Iterative approximation of solutions for proximal split feasibility problems
- The split equilibrium problem and its convergence algorithms
- Solving proximal split feasibility problems without prior knowledge of operator norms
- Strong convergence theorems for maximal monotone operators with nonlinear mappings in Hilbert spaces
- Split monotone variational inclusions
- Strong convergence for a countable family of strict pseudocontractions in -uniformly smooth Banach spaces
- Algorithms for the split variational inequality problem
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- Weak and strong convergence theorems for strict pseudo-contractions in Hilbert spaces
- Convergence theorems of fixed points for \(\kappa \)-strict pseudo-contractions in Hilbert spaces
- Convergence of the Mann iteration algorithm for a class of pseudocontractive mappings
- A multiprojection algorithm using Bregman projections in a product space
- Iterative algorithms for the multiple-sets split feasibility problem in Hilbert spaces
- Iterative methods for solving proximal split minimization problems
- Convergence analysis for proximal split feasibility problems and fixed point problems
- Iterative methods for strict pseudo-contractions in Hilbert 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$
- Solving the split feasibility problem without prior knowledge of matrix norms
- The multiple-sets split feasibility problem and its applications for inverse problems
- A variable Krasnosel'skii–Mann algorithm and the multiple-set split feasibility problem
- Newton-type methods for unconstrained and linearly constrained optimization
- Monotone Operators and the Proximal Point Algorithm
- Iterative oblique projection onto convex sets and the split feasibility problem
- Strong convergence result for proximal split feasibility problem in Hilbert spaces
- Nonlinear iteration method for proximal split feasibility problems
- A proximal-Newton method for unconstrained convex optimization in Hilbert spaces
- Accelerated hybrid viscosity and steepest-descent method for proximal split feasibility problems
- The Split Common Null Point Problem
- The relaxed CQ algorithm solving the split feasibility problem
- PARALLEL EXTRAGRADIENT-PROXIMAL METHODS FOR SPLIT EQUILIBRIUM PROBLEMS
- On the Maximality of Sums of Nonlinear Monotone Operators
- A note on the CQ algorithm for the split feasibility problem
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Parallel proximal method of solving split system of fixed point set constraint minimization problems