Projection methods: an annotated bibliography of books and reviews

DOI10.1080/02331934.2014.957701zbMath1328.65001arXiv1406.6143OpenAlexW2106454198MaRDI QIDQ3453406

Publication date: 27 November 2015

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.6143

zbMATH Keywords

convergence fixed points iterative algorithm variational inequalities parallel computing projection methods von Neumann row-action methods convex feasibility Cimmino Kaczmarz annotated bibliography

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to numerical analysis (65-00) Numerical methods for variational inequalities and related problems (65K15)

Related Items

Finding a best approximation pair of points for two polyhedra ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases ⋮ Feasibility-based fixed point networks ⋮ An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces ⋮ Circumcentering the Douglas-Rachford method ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Convergence rates for Kaczmarz-type algorithms ⋮ Can linear superiorization be useful for linear optimization problems? ⋮ A Sequential Constraint Method for Solving Variational Inequality over the Intersection of Fixed Point Sets ⋮ The Douglas-Rachford algorithm for convex and nonconvex feasibility problems ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ Comparing the methods of alternating and simultaneous projections for two subspaces ⋮ Kaczmarz's anomaly: a surprising feature of Kaczmarz's method ⋮ Convergence analysis of processes with valiant projection operators in Hilbert space ⋮ The cyclic Douglas–Rachford algorithm with r-sets-Douglas–Rachford operators ⋮ A variational approach to the alternating projections method ⋮ A new projection method for finding the closest point in the intersection of convex sets ⋮ Stability of a convex feasibility problem ⋮ Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces ⋮ A generalized projection-based scheme for solving convex constrained optimization problems ⋮ A hybrid extragradient method for a general split equality problem involving resolvents and pseudomonotone bifunctions in Banach spaces ⋮ Convergence rates of the Kaczmarz-Tanabe method for linear systems ⋮ Alternating conditional gradient method for convex feasibility problems ⋮ Derivative-free superiorization: principle and algorithm ⋮ Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm ⋮ A note on the finite convergence of alternating projections ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ Generating Correlation Matrices With Specified Eigenvalues Using the Method of Alternating Projections ⋮ Optimization on Spheres: Models and Proximal Algorithms with Computational Performance Comparisons

Cites Work