On Projection Algorithms for Solving Convex Feasibility Problems
From MaRDI portal
Publication:4714414
DOI10.1137/S0036144593251710zbMath0865.47039OpenAlexW2033511209WikidataQ59411105 ScholiaQ59411105MaRDI QIDQ4714414
Jonathan M. Borwein, Heinz H. Bauschke
Publication date: 13 July 1997
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0036144593251710
nonexpansive mappingconvex programmingsubdifferentialcomputerized tomographyconvex setimage recoveryorthogonal projectionfirmly nonexpansive mappingsubgradient algorithmaveraged mappingFejér monotone sequenceKaczmarz's methodconvex feasibility problemsSlater pointconvex inequalitiesCimmino's methodsuccessive projectionsangle between two subspacesquality of convergence
Convex programming (90C25) Biomedical imaging and signal processing (92C55) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Numerical solutions to equations with linear operators (65J10)
Related Items
Projection algorithms for solving nonmonotone equilibrium problems in Hilbert space ⋮ Computing and analyzing recoverable supports for sparse reconstruction ⋮ Linesearch algorithms for split equilibrium problems and nonexpansive mappings ⋮ On local convergence of the method of alternating projections ⋮ A simultaneous iterative method for split equality problems of two finite ⋮ Algorithmic and analytical approach to the split common fixed points problem ⋮ Parallel algorithms for variational inclusions and fixed points with applications ⋮ Approximate solutions to variational inequality over the fixed point set of a strongly nonexpansive mapping ⋮ Simultaneous iterative algorithms for the split common fixed-point problem of generalized asymptotically quasi-nonexpansive mappings without prior knowledge of operator norms ⋮ Acceleration of the Halpern algorithm to search for a fixed point of a nonexpansive mapping ⋮ Accelerated Mann and CQ algorithms for finding a fixed point of a nonexpansive mapping ⋮ Strong convergence theorems for Bregman \(W\)-mappings with applications to convex feasibility problems in Banach spaces ⋮ Genericity and porosity in fixed point theory: a survey of recent results ⋮ General iterative methods for monotone mappings and pseudocontractive mappings related to optimization problems ⋮ Parallel computing subgradient method for nonsmooth convex optimization over the intersection of fixed point sets of nonexpansive mappings ⋮ Iterative algorithm for the split equality problem in Hilbert spaces ⋮ Strong convergence of a regularization algorithm for common solutions with applications ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Subgradient algorithms for solving variable inequalities ⋮ Solutions of system of equilibrium and variational inequality problems on fixed points of infinite family of nonexpansive mappings ⋮ Dual averaging with adaptive random projection for solving evolving distributed optimization problems ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems ⋮ Projection on the intersection of convex sets ⋮ Cyclic subgradient extragradient methods for equilibrium problems ⋮ The limit of inconsistency reduction in pairwise comparisons ⋮ Single-projection procedure for linear optimization ⋮ Single projection Kaczmarz extended algorithms ⋮ Iterative algorithms for solving variational inequalities and fixed point problems for asymptotically nonexpansive mappings in Banach spaces ⋮ Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces ⋮ Bounded perturbation resilience of the viscosity algorithm ⋮ The strong convergence of a three-step algorithm for the split feasibility problem ⋮ Iterative algorithms for finding a common solution of system of the set of variational inclusion problems and the set of fixed point problems ⋮ An implicit iterative algorithm with errors for two families of generalized asymptotically nonexpansive mappings ⋮ Subgradient projection algorithms and approximate solutions of convex feasibility problems ⋮ Convergence of iterative sequences for fixed points of an infinite family of nonexpansive mappings based on a hybrid steepest descent method ⋮ Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization ⋮ A convergence result on random products of mappings in metric spaces ⋮ Restricted normal cones and the method of alternating projections: applications ⋮ Solving the variational inequality problem defined on intersection of finite level sets ⋮ A convergence result on random products of mappings in metric trees ⋮ Approximating fixed points of amenable semigroup and infinite family of nonexpansive mappings and solving systems of variational inequalities and systems of equilibrium problems ⋮ Strong and weak convergence theorems for an infinite family of nonexpansive mappings and applications ⋮ Hybrid method for equilibrium problems and fixed point problems of finite families of nonexpansive semigroups ⋮ Some results on fixed points of asymptotically strict quasi-\(\phi\)-pseudocontractions in the intermediate sense ⋮ Iterative processes for common fixed points of two different families of mappings with applications ⋮ Alternating projections on nontangential manifolds ⋮ Asymptotic behavior of averaged and firmly nonexpansive mappings in geodesic spaces ⋮ Strong convergence of a relaxed CQ algorithm for the split feasibility problem ⋮ Convergence theorems of a new iteration for asymptotically nonexpansive mappings in Banach spaces ⋮ A hybrid approximation algorithm for finding common solutions of equilibrium problems, a finite family of variational inclusions, and fixed point problems in Hilbert spaces ⋮ On finite convergence of iterative methods for variational inequalities in Hilbert spaces ⋮ An algorithm for a common fixed point of a family of pseudocontractive mappings ⋮ Linear and strong convergence of algorithms involving averaged nonexpansive operators ⋮ The alternating algorithm in a uniformly convex and uniformly smooth Banach space ⋮ Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings ⋮ Solutions for a variational inclusion problem with applications to multiple sets split feasibility problems ⋮ On the closedness of the sum of ranges of operators \(A_k\) with almost compact products \(A_i^\ast A_j\) ⋮ Operator splittings, Bregman methods and frame shrinkage in image processing ⋮ Strong convergence of the mann iteration for -demicontractive mappings ⋮ Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces ⋮ Regularized methods for the split feasibility problem ⋮ An iterative method for solving a system of mixed equilibrium problems, system of quasivariational inclusions, and fixed point problems of nonexpansive semigroups with application to optimization problems ⋮ Subgradient method for convex feasibility on Riemannian manifolds ⋮ Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem ⋮ Gradient-type methods: a unified perspective in computer science and numerical analysis ⋮ Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space ⋮ Convergence analysis of a block iterative version of the loping Landweber-Kaczmarz iteration ⋮ Generalized projections onto convex sets ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Fixed point optimization algorithm and its application to power control in CDMA data networks ⋮ Learning functions of few arbitrary linear parameters in high dimensions ⋮ Extrapolation and local acceleration of an iterative process for common fixed point problems ⋮ Convex feasibility modeling and projection methods for sparse signal recovery ⋮ A viscosity approximation scheme for finding common solutions of mixed equilibrium problems, a finite family of variational inclusions, and fixed point problems in Hilbert spaces ⋮ A perturbed projection algorithm with inertial technique for split feasibility problem ⋮ Applications of fixed-point and optimization methods to the multiple-set split feasibility problem ⋮ Algorithmic approach to a minimization problem ⋮ Variant gradient projection methods for the minimization problems ⋮ Common solutions to variational inequalities ⋮ Hybrid extragradient-like methods for generalized mixed equilibrium problems, systems of generalized equilibrium problems and optimization problems ⋮ Viscosity iterative scheme for generalized mixed equilibrium problems and nonexpansive semigroups ⋮ An infeasible-point subgradient method using adaptive approximate projections ⋮ A subgradient-like algorithm for solving vector convex inequalities ⋮ Solving proximal split feasibility problems without prior knowledge of operator norms ⋮ The method of alternating relaxed projections for two nonconvex sets ⋮ The convergence of the block cyclic projection with an overrelaxation parameter for compressed sensing based tomography ⋮ Compositions and convex combinations of averaged nonexpansive operators ⋮ A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem ⋮ About \([q\)-regularity properties of collections of sets] ⋮ A relaxed projection method for split variational inequalities ⋮ A cyclic and simultaneous iterative method for solving the multiple-sets split feasibility problem ⋮ Projection methods for quantum channel construction ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ Construction of a common element for the set of solutions of fixed point problems and generalized equilibrium problems in Hilbert spaces ⋮ Variable quasi-Bregman monotone sequences ⋮ Numerical methods for solving some matrix feasibility problems ⋮ OSQP: An Operator Splitting Solver for Quadratic Programs ⋮ Strong convergence theorem of two-step iterative algorithm for split feasibility problems ⋮ A simple algorithm for computing projection onto intersection of finite level sets ⋮ An iterative method for split equality variational inequality problems for non-Lipschitz pseudomonotone mappings ⋮ Alternating DC algorithm for partial DC programming problems ⋮ Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ Accelerated modified inertial Mann and viscosity algorithms to find a fixed point of \(\alpha\)-inverse strongly monotone operators ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Feasibility-based fixed point networks ⋮ Circumcentering approximate reflections for solving the convex feasibility problem ⋮ Data-driven project portfolio selection: decision-dependent stochastic programming formulations with reliability and time to market requirements ⋮ Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems ⋮ Applications of accelerated computational methods for quasi-nonexpansive operators to optimization problems ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ Riemannian stochastic fixed point optimization algorithm ⋮ On a notion of averaged mappings in \(\operatorname{CAT}(0)\) spaces ⋮ Kurdyka-Łojasiewicz exponent via inf-projection ⋮ Characterizations of stability of error bounds for convex inequality constraint systems ⋮ Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces ⋮ A real-time iterative projection scheme for solving the common fixed point problem and its applications ⋮ Some new characterizations of intrinsic transversality in Hilbert spaces ⋮ Numerical investigation of Fredholm integral equation of the first kind with noisy data ⋮ Geometric and metric characterizations of transversality properties ⋮ The block-wise circumcentered-reflection method ⋮ Parallel modified methods for pseudomonotone equilibrium problems and fixed point problems for quasi-nonexpansive mappings ⋮ A strong convergence theorem for a zero of the sum of a finite family of maximally monotone mappings ⋮ Deep neural network structures solving variational inequalities ⋮ Two modified extragradient algorithms for solving variational inequalities ⋮ Enhancement of the Kaczmarz algorithm with projection adjustment ⋮ Golden ratio algorithms for variational inequalities ⋮ Alternating projections, remotest projections, and greedy approximation ⋮ A new iterative algorithm for the multiple-sets split feasibility problem and the split equality fixed point problem ⋮ Global and linear convergence of alternated inertial methods for split feasibility problems ⋮ Convergence rates for boundedly regular systems ⋮ A variational approach to the alternating projections method ⋮ Finitely convergent iterative methods with overrelaxations revisited ⋮ Effect of shrinking projection and CQ-methods on two inertial forward-backward algorithms for solving variational inclusion problems ⋮ Alternating projection method for doubly stochastic inverse eigenvalue problems with partial eigendata ⋮ A parameterized Douglas-Rachford splitting algorithm for nonconvex optimization ⋮ Strong Abadie CQ, ACQ, calmness and linear regularity ⋮ Conversion of algorithms by releasing projection for minimization problems ⋮ Iterative methods for constrained convex minimization problem in Hilbert spaces ⋮ Family constraining of iterative algorithms ⋮ A cyclic Douglas-Rachford iteration scheme ⋮ Projected subgradient minimization versus superiorization ⋮ The rate of linear convergence of the Douglas-Rachford algorithm for subspaces is the cosine of the Friedrichs angle ⋮ Strong convergence of a self-adaptive method for the split feasibility problem ⋮ Convex optimization over fixed point sets of quasi-nonexpansive and nonexpansive mappings in utility-based bandwidth allocation problems with operational constraints ⋮ Projective splitting methods for sums of maximal monotone operators with applications ⋮ Quantitative characterizations of regularity properties of collections of sets ⋮ Subgradient projection algorithms for convex feasibility on Riemannian manifolds with lower bounded curvatures ⋮ Iterative process for solving a multiple-set split feasibility problem ⋮ Stability of a convex feasibility problem ⋮ Iterative methods for the split common fixed point problem in Hilbert spaces ⋮ Analysis on Newton projection method for the split feasibility problem ⋮ A new \(CQ\) method for solving split feasibility problem ⋮ A viscosity hybrid steepest descent method for equilibrium problems, variational inequality problems, and fixed point problems of infinite family of strictly pseudocontractive mappings and nonexpansive semigroup ⋮ Minimal infeasible constraint sets in convex integer programs ⋮ Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations ⋮ A strong convergence theorem for equilibrium problems and split feasibility problems in Hilbert spaces ⋮ Viscosity approximation process for a sequence of quasinonexpansive mappings ⋮ Circumcentered methods induced by isometries ⋮ Infeasibility detection in the alternating direction method of multipliers for convex optimization ⋮ A family of projection gradient methods for solving the multiple-sets split feasibility problem ⋮ A hybrid extragradient method for a general split equality problem involving resolvents and pseudomonotone bifunctions in Banach spaces ⋮ Inertial relaxed \textit{CQ} algorithms for solving a split feasibility problem in Hilbert spaces ⋮ On the method of reflections ⋮ An analysis of the superiorization method via the principle of concentration of measure ⋮ Solving composite fixed point problems with block updates ⋮ Notes on flexible sequential block iterative methods ⋮ Elasticity \(\mathcal{M} \)-tensors and the strong ellipticity condition ⋮ The circumcentered-reflection method achieves better rates than alternating projections ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning ⋮ Transversality properties: primal sufficient conditions ⋮ A projected subgradient method for nondifferentiable quasiconvex multiobjective optimization problems ⋮ Constraint reduction reformulations for projection algorithms with applications to wavelet construction ⋮ New inertial relaxed method for solving split feasibilities ⋮ Necessary conditions for linear convergence of iterated expansive, set-valued mappings ⋮ Error bounds for the method of simultaneous projections with infinitely many subspaces ⋮ Complexity of linear minimization and projection on some sets ⋮ Distributed optimization for degenerate loss functions arising from over-parameterization ⋮ Relaxed alternating CQ algorithms for the split equality problem in Hilbert spaces ⋮ An existence-uniqueness theorem and alternating contraction projection methods for inverse variational inequalities ⋮ A learning-enhanced projection method for solving convex feasibility problems ⋮ A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications ⋮ Linear convergence of the relaxed gradient projection algorithm for solving the split equality problems in Hilbert spaces ⋮ A new extragradient algorithm for split equilibrium problems and fixed point problems ⋮ An alternating iteration algorithm for solving the split equality fixed point problem with L-Lipschitz and quasi-pseudo-contractive mappings ⋮ Convergence rate analysis of an iterative algorithm for solving the multiple-sets split equality problem ⋮ An inertial extrapolation method for multiple-set split feasibility problem ⋮ Alternating projections with applications to Gerchberg-Saxton error reduction ⋮ Convergence analysis for variational inequalities and fixed point problems in reflexive Banach spaces ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors ⋮ Best approximation mappings in Hilbert spaces ⋮ A generalized block-iterative projection method for the common fixed point problem induced by cutters ⋮ A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems ⋮ A strong convergence theorem for solving an equilibrium problem and a fixed point problem using the Bregman distance ⋮ The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning ⋮ Kaczmarz method with oblique projection ⋮ An inertial Mann forward-backward splitting algorithm of variational inclusion problems and its applications ⋮ Viscosity \(S\)-iteration method with inertial technique and self-adaptive step size for split variational inclusion, equilibrium and fixed point problems ⋮ On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions ⋮ New subgradient extragradient methods for common solutions to equilibrium problems ⋮ An iterative algorithm for approximating convex minimization problem ⋮ An approach for the convex feasibility problem via monotropic programming ⋮ Some notes on Bauschke's condition ⋮ Regularized gradient-projection methods for equilibrium and constrained convex minimization problems ⋮ Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces ⋮ Strong convergence of a general iterative algorithm for equilibrium problems and variational inequality problems ⋮ A generalized \(f\)-projection method for countable families of weak relatively nonexpansive mappings and the system of generalized Ky Fan inequalities ⋮ Modified hybrid projection methods for finding common solutions to variational inequality problems ⋮ Inertial accelerated algorithms for solving a split feasibility problem ⋮ Random block coordinate descent methods for linearly constrained optimization over networks ⋮ The composite iteration algorithm for finding efficient and financially fair risk-sharing rules ⋮ Parallel and cyclic hybrid subgradient extragradient methods for variational inequalities ⋮ On the circumcentered-reflection method for the convex feasibility problem ⋮ A preconditioning method of the CQ algorithm for solving an extended split feasibility problem ⋮ Adaptively relaxed algorithms for solving the split feasibility problem with a new step size ⋮ The optimal error bound for the method of simultaneous projections ⋮ A dynamical system method for solving the split convex feasibility problem ⋮ The exponential convergence rate of Kaczmarz's algorithm and an acceleration strategy for ART ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Set regularities and feasibility problems ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Perturbation of error bounds ⋮ Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions ⋮ Learning doubly stochastic and nearly idempotent affinity matrix for graph-based clustering ⋮ Parallel extragradient algorithms for multiple set split equilibrium problems in Hilbert spaces ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ Strong convergence of alternating projections ⋮ A new step size rule for the superiorization method and its application in computerized tomography ⋮ Inertial projection and contraction methods for split feasibility problem applied to compressed sensing and image restoration ⋮ On the linear convergence of the circumcentered-reflection method ⋮ On connections between amplitude flow and error reduction for phase retrieval and ptychography ⋮ Convergence rate analysis for fixed-point iterations of generalized averaged nonexpansive operators ⋮ The Douglas-Rachford algorithm for a hyperplane and a doubleton ⋮ Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems ⋮ A new projection and contraction method for solving split monotone variational inclusion, pseudomonotone variational inequality, and common fixed point problems ⋮ Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces ⋮ How good are projection methods for convex feasibility problems? ⋮ An iterative method for finding common solutions of equilibrium and fixed point problems ⋮ Fixed point optimization algorithm and its application to network bandwidth allocation ⋮ Optimality conditions for composite DC infinite programming problems ⋮ Convergence of hybrid steepest-descent methods for generalized variational inequalities ⋮ On sampling Kaczmarz-Motzkin methods for solving large-scale nonlinear systems ⋮ Data-consistent neural networks for solving nonlinear inverse problems ⋮ Convergence of an extragradient-like iterative algorithm for monotone mappings and nonexpansive mappings ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Weak convergence theorems of the modified relaxed projection algorithms for the split feasibility problem in Hilbert spaces ⋮ Asymptotic behavior of inexact infinite products of nonexpansive mappings in metric spaces ⋮ Quantitative image recovery theorems ⋮ Sufficient conditions for error bounds and linear regularity in Banach spaces ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ A finite steps algorithm for solving convex feasibility problems ⋮ A family of projective splitting methods for the sum of two maximal monotone operators ⋮ On the Mann-type iteration and the convex feasibility problem ⋮ A new halfspace-relaxation projection method for the split feasibility problem ⋮ On linear infeasibility arising in intensity-modulated radiation therapy inverse planning ⋮ An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem ⋮ Bounded linear regularity of convex sets in Banach spaces and its applications ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Computational acceleration of projection algorithms for the linear best approximation problem ⋮ A hybrid inexact logarithmic-quadratic proximal method for nonlinear complementarity problems ⋮ A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping ⋮ New Douglas--Rachford Algorithmic Structures and Their Convergence Analyses ⋮ Duality and Convex Programming ⋮ Several iterative algorithms for solving the split common fixed point problem of directed operators with applications ⋮ Linear convergence of the Douglas–Rachford method for two closed sets ⋮ Stochastic First-Order Methods with Random Constraint Projection ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ Set intersection problems: supporting hyperplanes and quadratic programming ⋮ Optimization for Inconsistent Split Feasibility Problems ⋮ Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization ⋮ A variant of forward-backward splitting method for the sum of two monotone operators with a new search strategy ⋮ A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem ⋮ Strong convergence for the split common fixed-point problem for total quasi-asymptotically nonexpansive mappings in Hilbert space ⋮ Mixed iterative algorithms for the multiple-set split equality common fixed-point problems without prior knowledge of operator norms ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ REGULARITY PROPERTIES IN VARIATIONAL ANALYSIS AND APPLICATIONS IN OPTIMISATION ⋮ Strong convergence of a hybrid steepest descent method for the split common fixed point problem ⋮ Ergodic Convergence of a Stochastic Proximal Point Algorithm ⋮ Relaxed CQ algorithms involving the inertial technique for multiple-sets split feasibility problems ⋮ Extremality, stationarity and generalized separation of collections of sets ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions ⋮ On linear convergence of non-Euclidean gradient methods without strong convexity and Lipschitz gradient continuity ⋮ Gradient projection-type algorithms for solving equilibrium problems and its applications ⋮ Split common fixed point problems for demicontractive operators ⋮ On the rate of convergence of the alternating projection method in finite dimensional spaces ⋮ Algorithms for the quasiconvex feasibility problem ⋮ A self-adaptive iterative algorithm for the split common fixed point problems ⋮ Random minibatch subgradient algorithms for convex problems with functional constraints ⋮ Necessary and sufficient conditions for emptiness of the cones of generalized support vectors ⋮ Projection onto simplicial cones by a semi-smooth Newton method ⋮ New iteration process for pseudocontractive mappings with convergence analysis ⋮ Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods ⋮ General method for solving the split common fixed point problem ⋮ Convergence analysis for Kaczmarz-type methods in a Hilbert space framework ⋮ Projection onto simplicial cones by Picard's method ⋮ On the finite convergence of a projected cutter method ⋮ Bi-extrapolated subgradient projection algorithm for solving multiple-sets split feasibility problem ⋮ The rate of convergence in the method of alternating projections ⋮ Generalized isotone projection cones ⋮ A Linearly Convergent Algorithm for Solving a Class of Nonconvex/Affine Feasibility Problems ⋮ The Douglas–Rachford Algorithm in the Absence of Convexity ⋮ Opial-Type Theorems and the Common Fixed Point Problem ⋮ Proximal Splitting Methods in Signal Processing ⋮ Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES ⋮ Application of Quasi-Nonexpansive Operators to an Iterative Method for Variational Inequality ⋮ Hybrid steepest-descent methods with a countable family of nonexpansive mappings for variational inequalities in Hilbert spaces ⋮ Accelerated reflection projection algorithm and its application to the LMI problem ⋮ A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces ⋮ Projection methods: an annotated bibliography of books and reviews ⋮ Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds ⋮ The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments ⋮ PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING ⋮ Self-adaptive algorithms for the split problem of the demicontractive operators ⋮ Strong convergence of an iterative algorithm involving nonlinear mappings of nonexpansive and accretive type ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ Totally relaxed, self-adaptive algorithm for solving variational inequalities over the intersection of sub-level sets ⋮ DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS ⋮ A Successive Projection Algorithm for Solving the Multiple-Sets Split Feasibility Problem ⋮ CONVERGENCE OF MANN’S ALTERNATING PROJECTIONS IN CAT() SPACES ⋮ On the sensitivity of a Euclidean projection ⋮ Distributed solutions for loosely coupled feasibility problems using proximal splitting methods ⋮ Perturbation-Resilient Iterative Methods with an Infinite Pool of Mappings ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ Maximum entropy and feasibility methods for convex and nonconvex inverse problems ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Quasi-Nonexpansive Iterations on the Affine Hull of Orbits: From Mann's Mean Value Algorithm to Inertial Methods ⋮ An Iterative Algorithm for Split Common Fixed-Point Problem for Demicontractive Mappings ⋮ Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings ⋮ Ubiquitous algorithms in convex optimization generate self-contracted sequences ⋮ Automated Multilateral Negotiation on Multiple Issues with Private Information ⋮ The method of alternating projections and the method of subspace corrections in Hilbert space ⋮ Projection methods for the linear split feasibility problems ⋮ Robust static and fixed-order dynamic output feedback control of discrete-time parametric uncertain Luré systems: Sequential SDP relaxation approaches ⋮ A new iterative method for the split common fixed point problem in Hilbert spaces ⋮ Outer approximation methods for solving variational inequalities in Hilbert space ⋮ METRIC REGULARITY—A SURVEY PART II. APPLICATIONS ⋮ Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting ⋮ A Block Lanczos Method for the Extended Trust-Region Subproblem ⋮ Fixed point algorithms for the split problem of demicontractive operators ⋮ Fixed Point Analysis of Douglas--Rachford Splitting for Ptychography and Phase Retrieval ⋮ A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization ⋮ Applications of Mann's method to the split common fixed point problem ⋮ Random Function Iterations for Consistent Stochastic Feasibility ⋮ Relaxed inertial accelerated algorithms for solving split equality feasibility problem ⋮ Choosing the relaxation parameter in sequential block-iterativemethods for linear systems ⋮ Regular Sequences of Quasi-Nonexpansive Operators and Their Applications ⋮ General alternative regularization methods for split equality common fixed-point problem ⋮ The ball-relaxed CQ algorithms for the split feasibility problem ⋮ On inertial proximal algorithm for split variational inclusion problems ⋮ Fejér-monotone hybrid steepest descent method for affinely constrained and composite convex minimization tasks ⋮ Characterizing arbitrarily slow convergence in the method of alternating projections ⋮ Block‐iterative algorithms ⋮ On the string averaging method for sparse common fixed‐point problems ⋮ From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation ⋮ Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections ⋮ Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems ⋮ A simple closure condition for the normal cone intersection formula ⋮ A new proximal point iteration that converges weakly but not in norm ⋮ Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings ⋮ Quadratic optimization of fixed points of nonexpansive mappings in hubert space ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ Non-Convex feasibility problems and proximal point methods ⋮ Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions ⋮ Nonstrictly Convex Minimization over the Bounded Fixed Point Set of a Nonexpansive Mapping ⋮ A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets ⋮ A GENERAL ITERATIVE ALGORITHM FOR EQUILIBRIUM PROBLEMS AND VARIATIONAL INEQUALITY PROBLEMS IN A HILBERT SPACE ⋮ A subgradient-type method for the equilibrium problem over the fixed point set and its applications ⋮ Unnamed Item ⋮ Some results on non-expansive mappings and relaxed cocoercive mappings in Hilbert spaces ⋮ Cases of ineffectiveness of geometric cuts in sequential projection methods ⋮ Viscosity methods for common solutions for equilibrium and hierarchical fixed point problems ⋮ A new hybrid method for hierarchical fixed points problems and variational inequality problems ⋮ Inexact Infinite Products of Nonexpansive Mappings ⋮ Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space ⋮ Incremental subgradient method for nonsmooth convex optimization with fixed point constraints ⋮ Convergence of string-averaging method for a class of operators ⋮ Set-theoretic adaptive filtering based on data-driven sparsification ⋮ Adaptive subgradient method for the split quasi-convex feasibility problems ⋮ On the finite termination of the Douglas-Rachford method for the convex feasibility problem ⋮ Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces ⋮ Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem ⋮ Convergence in Norm of Projection Regularized Krasnoselski-Mann Iterations for Fixed Points of Cutters ⋮ Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators ⋮ Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings ⋮ The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings ⋮ Parallel Block-Iterative Reconstruction Algorithms for Binary Tomography ⋮ Distance to the intersection of normal sets and applications ⋮ A dynamical systems approach to constrained minimization ⋮ The composition of projections onto closed convex sets in Hilbert space is asymptotically regular ⋮ An inertial Mann algorithm for nonexpansive mappings ⋮ A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem ⋮ Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ A projection method for semidefinite linear systems and its applications ⋮ Steered sequential projections for the inconsistent convex feasibility problem ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ A non-interior continuation algorithm for solving the convex feasibility problem ⋮ The combination projection method for solving convex feasibility problems ⋮ Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization ⋮ Convergences of alternating projections in \(\mathrm{CAT}(\kappa)\) spaces ⋮ Circumcentering the Douglas-Rachford method ⋮ Some convergence strategies for the alternating generalized projection method ⋮ Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ Error bounds in mathematical programming ⋮ Two algorithms for solving systems of inclusion problems ⋮ On the computation of the step-size for the CQ-like algorithms for the split feasibility problem ⋮ On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators ⋮ A new approximation method for finding common elements of equilibrium problems, variational inequality problems and fixed point problems of nonspreading mappings ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ A unified approach to error bounds for structured convex optimization problems ⋮ Generalized Bregman projections in convex feasibility problems ⋮ Bounded perturbation resilience of extragradient-type methods and their applications ⋮ A storm of feasibility pumps for nonconvex MINLP ⋮ Viscosity iterative algorithms for fixed point problems of asymptotically nonexpansive mappings in the intermediate sense and variational inequality problems in Banach spaces ⋮ Dykstra's algorithm for constrained least-squares rectangular matrix problems ⋮ Extragradient-proximal methods for split equilibrium and fixed point problems in Hilbert spaces ⋮ Peaceman-Rachford splitting for a class of nonconvex optimization problems ⋮ A semismooth Newton method for nonlinear symmetric cone programming ⋮ A new general system of generalized nonlinear mixed composite-type equilibria and fixed point problems with an application to minimization problems ⋮ On asymptotically quasi-\(\phi\)-nonexpansive mappings in the intermediate sense ⋮ An acceleration scheme for cyclic subgradient projections method ⋮ Convergence and perturbation resilience of dynamic string-averaging projection methods ⋮ Two-step projection methods for a system of variational inequality problems in Banach spaces ⋮ Global error bounds for piecewise convex polynomials ⋮ Proximity algorithms for the L1/TV image denoising model ⋮ Averaged alternating reflections in geodesic spaces ⋮ An iterative approach to quadratic optimization ⋮ General split feasibility problems in Hilbert spaces ⋮ Convergence analysis of processes with valiant projection operators in Hilbert space ⋮ Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope ⋮ Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. ⋮ Linear convergence of the randomized sparse Kaczmarz method ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ The split feasibility problem and its solution algorithm ⋮ Two-step viscosity approximation scheme for variational inequality in Banach spaces ⋮ Strong convergence algorithms of the split common fixed point problem for total quasi-asymptotically pseudocontractive operators ⋮ Solving split common fixed-point problem of firmly quasi-nonexpansive mappings without prior knowledge of operators norms ⋮ Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem ⋮ Iterative algorithms for the split problem and its convergence analysis ⋮ An algorithm for generalized constrained multi-source Weber problem with demand substations ⋮ Functional data analysis by matrix completion ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ Distributed optimization over directed graphs with row stochasticity and constraint regularity ⋮ Iterative algorithms for solving the split feasibility problem in Hilbert spaces ⋮ Two-step methods and relaxed two-step methods for solving the split equality problem ⋮ About intrinsic transversality of pairs of sets ⋮ Projected subgradient algorithms on systems of equilibrium problems ⋮ Relaxed two points projection method for solving the multiple-sets split equality problem ⋮ A scratch covering algorithm using affine projection method ⋮ A modified iterative method for split problem of variational inclusions and fixed point problems ⋮ On closedness of the sum of \(n\) subspaces of a Hilbert space ⋮ Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces ⋮ Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions ⋮ Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces ⋮ Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces ⋮ Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets ⋮ Functions with prescribed best linear approximations ⋮ Hybrid viscosity-like approximation methods for nonexpansive mappings in Hilbert spaces ⋮ Efficient computation of the Hausdorff distance between polytopes by exterior random covering ⋮ Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods ⋮ Convergence analysis of modified hybrid steepest-descent methods with variable parameters for variational inequalities ⋮ On modified hybrid steepest-descent methods for general variational inequalities ⋮ A new extragradient-type algorithm for the split feasibility problem ⋮ The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets ⋮ On the regularity condition in a convex feasibility problem ⋮ Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings ⋮ Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces ⋮ Iterative schemes for computing fixed points of nonexpansive mappings in Banach spaces ⋮ Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings ⋮ Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping ⋮ The set of divergent infinite products in a Banach space is \(\sigma\)-porous ⋮ Mixed equilibrium problems and optimization problems ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem ⋮ On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space ⋮ Parallel iterative regularization methods for solving systems of ill-posed equations ⋮ Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces ⋮ A general iterative method for solving the variational inequality problem and fixed point problem of an infinite family of nonexpansive mappings in Hilbert spaces ⋮ Metric subregularity and the proximal point method ⋮ Strong convergence theorems of modified Ishikawa iterations for countable hemi-relatively nonexpansive mappings in a Banach space ⋮ Generic power convergence of order-preserving mappings ⋮ Strong convergence theorems by hybrid methods for a finite family of nonexpansive mappings and inverse-strongly monotone mappings ⋮ Convergence of a hybrid projection algorithm in Banach spaces ⋮ Enlarged cores and bargaining schemes in games with fuzzy coalitions ⋮ A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin ⋮ Strong convergence theorems of modified Ishikawa iterative process with errors for an infinite family of strict pseudo-contractions ⋮ Fejér processes with diminishing disturbances ⋮ Acoustic feedback cancellation based on weighted adaptive projection subgradient method in hearing aids ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\) ⋮ Generalized Mann iterates for constructing fixed points in Hilbert spaces ⋮ Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings ⋮ Convergence of a randomized Douglas-Rachford method for linear system ⋮ Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces ⋮ Primal necessary characterizations of transversality properties ⋮ Dual sufficient characterizations of transversality properties ⋮ Clarke generalized Jacobian of the projection onto symmetric cones ⋮ A new mapping for finding common solutions of equilibrium problems and fixed point problems of finite family of nonexpansive mappings ⋮ Halpern iteration for firmly type nonexpansive mappings ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ An ergodic algorithm for the power-control games for CDMA data networks ⋮ Coincidence points by generalized Mann iterates with applications in Hilbert spaces ⋮ New iterative scheme with nonexpansive mappings for equilibrium problems and variational inequality problems in Hilbert spaces ⋮ Geometric condition measures and smoothness condition measures for closed convex sets and linear regularity of infinitely many closed convex sets ⋮ Iterative selection methods for common fixed point problems ⋮ The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets ⋮ The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ Finding best approximation pairs relative to two closed convex sets in Hilbert spaces ⋮ Convergence of hybrid steepest-descent methods for variational inequalities ⋮ A general iterative method for a finite family of nonexpansive mappings ⋮ Minimization of equilibrium problems, variational inequality problems and fixed point problems ⋮ Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence ⋮ Strong convergence theorem for pseudo-contractive mappings in Hilbert spaces ⋮ Composite algorithms for minimization over the solutions of equilibrium problems and fixed point problems ⋮ Modified hybrid steepest-descent methods for variational inequalities and fixed points ⋮ Algorithms for projecting a point onto a level surface of a continuous function on a compact set ⋮ Variable target value relaxed alternating projection method ⋮ The asymptotic behavior of the composition of firmly nonexpansive mappings ⋮ Iterative methods for finding common solution of generalized equilibrium problems and variational inequality problems and fixed point problems of a finite family of nonexpansive mappings ⋮ New iterative approximation methods for a countable family of nonexpansive mappings in Banach spaces ⋮ A stable convergence theorem for infinite products of nonexpansive mappings in Banach spaces ⋮ A projection method for solving nonlinear problems in reflexive Banach spaces ⋮ Iterative methods for solving variational inequalities in Euclidean space ⋮ A randomized approximation algorithm for the minimal-norm static-output-feedback problem ⋮ The relaxed inexact projection methods for the split feasibility problem ⋮ A general iterative scheme for \(k\)-strictly pseudo-contractive mappings and optimization problems ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping ⋮ Strong convergence by a hybrid algorithm for finding a common fixed point of Lipschitz pseudocontraction and strict pseudocontraction in Hilbert spaces ⋮ Split monotone variational inclusions ⋮ Strong convergence of iterative methods by strictly pseudocontractive mappings in Banach spaces ⋮ Alternating projections in CAT(0) spaces ⋮ Robustness of Krasnoselski-Mann's algorithm for asymptotically nonexpansive mappings ⋮ Random algorithms for convex minimization problems ⋮ Finite convergence of a subgradient projections method with expanding controls ⋮ On a generalized Ky Fan inequality and asymptotically strict pseudocontractions in the intermediate sense ⋮ An implicit method for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of infinite family of nonexpansive mappings ⋮ An iterative algorithm for solving fixed point problems, variational inequality problems and mixed equilibrium problems ⋮ The general iterative methods for nonexpansive mappings in Banach spaces ⋮ A system of generalized mixed equilibrium problems, maximal monotone operators, and fixed point problems with application to optimization problems ⋮ Iterative algorithms for variational inclusions, mixed equilibrium and fixed point problems with application to optimization problems ⋮ Strong convergence of a general iterative method for variational inequality problems and fixed point problems in Hilbert spaces ⋮ Decentralized algorithm for centralized variational inequalities in network resource allocation ⋮ Algorithms for the split variational inequality problem ⋮ Convergence theorems of fixed points for a finite family of nonexpansive mappings in Banach spaces ⋮ A general iterative method for an infinite family of nonexpansive mappings ⋮ Convergence studies on block iterative algorithms for image reconstruction ⋮ Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Strong convergence of a modified iterative algorithm for mixed-equilibrium problems in Hilbert spaces ⋮ Convergence properties of dynamic string-averaging projection methods in the presence of perturbations ⋮ Error minimizing relaxation strategies in Landweber and Kaczmarz type iterations ⋮ Strong convergence theorems of common elements for equilibrium problems and fixed point problems in Banach spaces ⋮ Obituary: Jonathan M. Borwein (1951--2016). Homo sapiens, homo ludens ⋮ On an open question of Moudafi for convex feasibility problems in Hilbert spaces ⋮ Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings ⋮ About subtransversality of collections of sets ⋮ Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings ⋮ A note on alternating projections for ill-posed semidefinite feasibility problems ⋮ Non-monotonous sequential subgradient projection algorithm for convex feasibility problem ⋮ Partitioning strategies for the block Cimmino algorithm ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ A theorem on strict separability of convex polyhedra and its applications in optimization ⋮ Iterative algorithm for solving triple-hierarchical constrained optimization problem ⋮ A new iterative algorithm for the set of fixed-point problems of nonexpansive mappings and the set of equilibrium problem and variational inequality problem ⋮ Strong convergence of shrinking projection methods for quasi-nonexpansive mappings and equilibrium problems ⋮ Iterative methods for the computation of fixed points of demicontractive mappings ⋮ Sliding window generalized kernel affine projection algorithm using projection mappings ⋮ A note on the split common fixed-point problem for quasi-nonexpansive operators ⋮ Cyclic algorithms for split feasibility problems in Hilbert spaces ⋮ Compositions and averages of two resolvents: relative geometry of fixed points sets and a partial answer to a question by C.\,Byrne ⋮ A note on Solodov and Tseng's methods for maximal monotone mappings ⋮ Equivalent theorems of the convergence between Ishikawa-Halpern iteration and viscosity approximation method ⋮ Common fixed points of strict pseudocontractions by iterative algorithms ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Convergence in norm of modified Krasnoselski-Mann iterations for fixed points of demicontractive mappings ⋮ The asymptotic behavior of the composition of two resolvents ⋮ Strong convergence for a minimization problem on points of equilibrium and common fixed points of an infinite family of nonexpansive mappings ⋮ Optimum signal and image recovery by the method of alternating projections in fractional Fourier domains ⋮ ``Optimal choice of the step length of the projection and contraction methods for solving the split feasibility problem ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ A convergent relaxation of the Douglas-Rachford algorithm ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ Line search fixed point algorithms based on nonlinear conjugate gradient directions: application to constrained smooth convex optimization ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem. ⋮ Some remarks on the paper ``Strong convergence of a self-adaptive method for the split feasibility problem ⋮ Application of a new accelerated algorithm to regression problems ⋮ New iteration scheme for approximating a common fixed point of a finite family of mappings ⋮ An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems ⋮ Ball-relaxed projection algorithms for multiple-sets split feasibility problem ⋮ On applications of the calmness moduli for multifunctions to error bounds ⋮ Iterative algorithms for common solutions of split mixed equilibrium problems and fixed point problems of λ-hybrid multivalued mappings ⋮ Common Solutions to Variational Inequality Problem via Parallel and Cyclic Hybrid Inertial CQ-Subgradient Extragradient Algorithms in (HSs) ⋮ The subgradient extragradient method for solving pseudomonotone equilibrium and fixed point problems in Banach spaces ⋮ Using projected cutting planes in the extended cutting plane method ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces ⋮ A WEAK ERGODIC THEOREM FOR INFINITE PRODUCTS OF OPERATORS IN METRIC SPACES ⋮ Variational Analysis of Composite Models with Applications to Continuous Optimization ⋮ Two iterative algorithms for solving the split common fixed point problems ⋮ Optimization of triangular networks with spatial constraints ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ A splitting method for finding the resolvent of the sum of two maximal monotone operators ⋮ Sample average approximation with heavier tails. I: Non-asymptotic bounds with weak assumptions and stochastic constraints ⋮ An inertial viscosity algorithm for solving monotone variational inclusion and common fixed point problems of strict pseudocontractions ⋮ Error bounds, facial residual functions and applications to the exponential cone ⋮ Spatial regression and spillover effects in cluster randomized trials with count outcomes ⋮ An algorithm for quasiconvex equilibrium problems and asymptotically nonexpansive mappings: application to a Walras model with implicit supply-demand ⋮ An ordinary differential equation for modeling Halpern fixed-point Algorithm ⋮ Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications ⋮ Polynomial estimates for the method of cyclic projections in Hilbert spaces ⋮ Block-circulant complex Hadamard matrices ⋮ Inertial accelerated steepest descent algorithm for generalized split common fixed point problems ⋮ Unrestricted Douglas-Rachford algorithms for solving convex feasibility problems in Hilbert space ⋮ Viscosity approximation method for split best proximity point and monotone variational inclusion problem ⋮ On the centralization of the circumcentered-reflection method ⋮ Proximal Activation of Smooth Functions in Splitting Algorithms for Convex Image Recovery ⋮ Strong Convergence Theorem Obtained by a Generalized Projections Method for Solving an Equilibrium Problem and Fixed Point Problems ⋮ Alternated inertial algorithms for split feasibility problems ⋮ Relative regularity conditions and linear regularity properties for split feasibility problems in normed linear spaces ⋮ The generalized modular string averaging procedure and its applications to iterative methods for solving various nonlinear operator theory problems ⋮ Comparing the methods of alternating and simultaneous projections for two subspaces ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Douglas–Rachford algorithm for control-constrained minimum-energy control problems ⋮ Convergence theorem for split feasibility problem, equilibrium problem and zeroes of sum of monotone operators ⋮ Inertial self-adaptive parallel extragradient-type method for common solution of variational inequality problems ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory ⋮ Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming ⋮ A successive centralized circumcentered-reflection method for the convex feasibility problem ⋮ Exact convergence rates of alternating projections for nontransversal intersections ⋮ New Bregman projection algorithms for solving the split feasibility problem ⋮ Relaxed double inertial Tseng's extragradient method for solving non-Lipschitz split monotone variational inclusion problems with fixed point constraints ⋮ The use of additional diminishing disturbances in Fejer models of iterative algorithms ⋮ Two relaxed CQ methods for the split feasibility problem with multiple output sets ⋮ MODIFIED INERTIAL HYBRID SUBGRADIENT EXTRAGRADIENT METHOD FOR SOLVING VARIATIONAL INEQUALITIES AND FIXED POINT PROBLEMS FOR AN INFINITE FAMILY OF MULTIVALUED RELATIVELY NONEXPANSIVE MAPPINGS IN BANACH SPACES WITH APPLICATIONS ⋮ Convergence rate of the relaxed CQ algorithm under Hölderian type error bound property ⋮ An algorithmic approach to solving split common fixed point problems for families of demicontractive operators in Hilbert spaces ⋮ Convergence Rate Analysis of a Dykstra-Type Projection Algorithm ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ Outer Approximation Methods for Solving Variational Inequalities Defined over the Solution Set of a Split Convex Feasibility Problem ⋮ Geometry of the phase retrieval problem ⋮ Unnamed Item ⋮ Structure-Preserving Function Approximation via Convex Optimization ⋮ Unnamed Item ⋮ Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations ⋮ When products of projections diverge ⋮ Unnamed Item ⋮ Critical Multipliers in Semidefinite Programming ⋮ Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices ⋮ Learning Data Manifolds with a Cutting Plane Method ⋮ Unnamed Item ⋮ Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators ⋮ Attracting mappings in Banach and hyperbolic spaces ⋮ Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem ⋮ The method of subspace corrections ⋮ Convergence of Krasnoselskii-Mann iterations of nonexpansive operators ⋮ A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space ⋮ A Bregman projection method for approximating fixed points of quasi-Bregman nonexpansive mappings ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ Binary steering in discrete tomography reconstruction with sequential and simultaneous iterative algorithms ⋮ The Kaczmarz algorithm, row action methods, and statistical learning algorithms ⋮ Learning Theory of Randomized Sparse Kaczmarz Method ⋮ Aggregating Large Sets of Probabilistic Forecasts by Weighted Coherent Adjustment ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Bounded perturbation resilience of projected scaled gradient methods ⋮ Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm ⋮ A semi-smooth Newton method for a special piecewise linear system with application to positively constrained convex quadratic programming ⋮ Unnamed Item ⋮ Gradient methods with selection technique for the multiple-sets split feasibility problem ⋮ Weak, strong and linear convergence of the CQ-method via the regularity of Landweber operators ⋮ Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities ⋮ Convex feasibility problems on uniformly convex metric spaces ⋮ Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm ⋮ Norm convergence of realistic projection and reflection methods ⋮ -CONVERGENCES OF WEIGHTED AVERAGED PROJECTIONS IN SPACES ⋮ SURVEY: SIXTY YEARS OF DOUGLAS–RACHFORD ⋮ Perturbed iterative methods for a general family of operators: convergence theory and applications ⋮ Inertial accelerated algorithms for the split common fixed-point problem of directed operators ⋮ Solving the general split common fixed-point problem of quasi-nonexpansive mappings without prior knowledge of operator norms ⋮ Global convergence of the alternating projection method for the Max-Cut relaxation problem ⋮ Method of Alternating Contractions and Its Applications to Some Convex Optimization Problems ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ Asymptotic regularity, fixed points and successive approximations ⋮ Strong convergence of Halpern iteration for products of finitely many resolvents of maximal monotone operators in Banach spaces ⋮ On Degenerate Doubly Nonnegative Projection Problems ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems ⋮ Strong convergence algorithm for the split problem of variational inclusions, split generalized equilibrium problem and fixed point problem ⋮ Modified CQ-Algorithms for G-Nonexpansive Mappings in Hilbert Spaces Involving Graphs ⋮ Hybrid projection methods for equilibrium problems with non‐Lipschitz type bifunctions ⋮ A self-adaptive projection-type method for nonlinear multiple-sets split feasibility problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Nonexpansiveness of a linearized augmented Lagrangian operator for hierarchical convex optimization ⋮ Convergence to approximate solutions and perturbation resilience of iterative algorithms ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ Superiorization with level control ⋮ Unnamed Item ⋮ A Distributed Boyle--Dykstra--Han Scheme ⋮ Convergence of weighted averages of relaxed projections ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space ⋮ Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? ⋮ AN EXAMPLE CONCERNING BOUNDED LINEAR REGULARITY OF SUBSPACES IN HILBERT SPACE ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ An iterative method for solving the strong vector equilibrium problem with variable domination structure ⋮ String-averaging projected subgradient methods for constrained minimization ⋮ Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem ⋮ Strong CHIP, normality, and linear regularity of convex sets ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Linear Convergence of Projection Algorithms ⋮ General iterative method for solving fixed point problems involving a finite family of demicontractive mappings in Banach spaces ⋮ The Split Equality Fixed Point Problem for Quasi-Pseudo-Contractive Mappings Without Prior Knowledge of Norms ⋮ Projection algorithms with dynamic stepsize for constrained composite minimization ⋮ Iterative methods for solving the split common fixed point problem of demicontractive mappings in Hilbert spaces ⋮ Abstract convergence theorem for quasi-convex optimization problems with applications ⋮ Unnamed Item ⋮ Stochastic (Approximate) Proximal Point Methods: Convergence, Optimality, and Adaptivity ⋮ Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets ⋮ Scalable Bayesian Uncertainty Quantification in Imaging Inverse Problems via Convex Optimization ⋮ PARALLEL EXTRAGRADIENT-PROXIMAL POINT METHODS FOR MULTIPLE SET SPLIT EQUILIBRIUM PROBLEMS OF PSEUDOMONOTONE MAPPINGS IN HILBERT SPACES ⋮ General Iterative Methods for Semigroups of Nonexpansive Mappings Related to Optimization Problems ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Stochastic Quasi-Fejér Block-Coordinate Fixed Point Iterations with Random Sweeping ⋮ The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem ⋮ The Landweber Operator Approach to the Split Equality Problem ⋮ On Subgradient Projectors ⋮ Algorithms for split common null point problem without pre-existing estimation of operator norm ⋮ Projection methods for high numerical aperture phase retrieval ⋮ Hierarchical Minimization Problems and Applications ⋮ Convergence and Semi-Convergence of a Class of Constrained Block Iterative Methods ⋮ Split Feasibility and Fixed Point Problems ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications ⋮ On Componental Operators in Hilbert Space ⋮ Viscosity Approximation Methods for Split Common Fixed-Point Problem of Directed Operators
