The method of projections for finding the common point of convex sets

DOI10.1016/0041-5553(67)90113-9zbMath0199.51002OpenAlexW2085440994WikidataQ59411106 ScholiaQ59411106MaRDI QIDQ5597971

Eh. V. Rajk, L. G. Gurin, Boris T. Polyak

Publication date: 1970

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(67)90113-9

zbMATH Keywords

numerical analysis

Related Items (only showing first 100 items - show all)

Weak and norm convergence of a parallel projection method in Hilbert spaces ⋮ Opial-Type Theorems and the Common Fixed Point Problem ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ Accelerated reflection projection algorithm and its application to the LMI problem ⋮ Projection methods: an annotated bibliography of books and reviews ⋮ Improved constraint consensus methods for seeking feasibility in nonlinear programs ⋮ PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ On finitely convergent iterative methods for the convex feasibility problem ⋮ Iterations of parallel convex projections in hilbert spaces ⋮ Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature ⋮ Distributed discrete-time convex optimization with nonidentical local constraints over time-varying unbalanced directed graphs ⋮ Distributed solutions for loosely coupled feasibility problems using proximal splitting methods ⋮ On the behavior of a block-iterative projection method for solving convex feasibility problems ⋮ Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates ⋮ Strong convergence of expected-projection methods in hilbert spaces ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces ⋮ Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems ⋮ A new algorithm for the minimax location problem with the closest distance ⋮ Multi-dimensional summation-by-parts operators for general function spaces: theory and construction ⋮ On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds ⋮ Alternating convex projection methods for covariance control design ⋮ How good are projection methods for convex feasibility problems? ⋮ Exact convergence rates of alternating projections for nontransversal intersections ⋮ On the behaviour of the underrelaxed Hildreth's row-action method for computing projections onto Polyhedra ⋮ Convergence of random sleep algorithms for optimal consensus ⋮ A Privacy-Preserving Method to Optimize Distributed Resource Allocation ⋮ METRIC REGULARITY—A SURVEY PART II. APPLICATIONS ⋮ A counterexample to De Pierro's conjecture on the convergence of under-relaxed cyclic projections ⋮ Structure-Preserving Function Approximation via Convex Optimization ⋮ Iterative solution of convex problems by fejer-monotone methods ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters ⋮ Cyclic projection methods on a class of nonconvex sets ⋮ Solving stochastic convex feasibility problems in hilbert spaces ⋮ Random Function Iterations for Consistent Stochastic Feasibility ⋮ A finite steps algorithm for solving convex feasibility problems ⋮ On the Mann-type iteration and the convex feasibility problem ⋮ Behavior of nonlinear pocs higher order algorithms in the deconvolution problem ⋮ New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization ⋮ Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems ⋮ A complex projection scheme and applications ⋮ Robustness analysis of discrete time-delay systems ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions ⋮ A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets ⋮ Stochastic First-Order Methods with Random Constraint Projection ⋮ Specific stability region analysis for uncertain fuzzy descriptor systems with multiple derivative matrices ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Phase Retrieval via Matrix Completion ⋮ Improved transmission design algorithms by utilizing variable-strength projections ⋮ Set intersection problems: supporting hyperplanes and quadratic programming ⋮ A Geometrical Look at Iterative Methods for Operators with Fixed Points ⋮ Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Moduli of regularity and rates of convergence for Fejér monotone sequences ⋮ 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 ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods ⋮ An Implicit Representation and Iterative Solution of Randomly Sketched Linear Systems ⋮ The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings ⋮ The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem ⋮ Iteration process for fixed point problems and zeros of maximal monotone operators ⋮ Decomposition through formalization in a product space ⋮ Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections ⋮ Cyclic subgradient projections ⋮ A Variational Inequality Model for the Construction of Signals from Inconsistent Nonlinear Equations ⋮ An alternating projection that does not converge in norm ⋮ Distributed continuous-time approximate projection protocols for shortest distance optimization problems ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ A projection method for semidefinite linear systems and its applications ⋮ Steered sequential projections for the inconsistent convex feasibility problem ⋮ Local linear convergence for alternating and averaged nonconvex projections ⋮ A parallel subgradient projections method for the convex feasibility problem ⋮ A multiprojection algorithm using Bregman projections in a product space ⋮ Incorporation of a priori moment information into signal recovery and synthesis problems ⋮ The combination projection method for solving convex feasibility problems ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems ⋮ Generalized pole placement via static output feedback: a methodology based on projections ⋮ Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces ⋮ Single projection Kaczmarz extended algorithms ⋮ A finitely convergent ``row-action method for the convex feasibility problem ⋮ A parallel projection method based on sequential most remote set in convex feasibility problems ⋮ On some optimization techniques in image reconstruction from projections ⋮ Alternating convex projection methods for discrete-time covariance control design ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ A real-time iterative projection scheme for solving the common fixed point problem and its applications ⋮ Subgradient projection algorithms and approximate solutions of convex feasibility problems ⋮ Restricted normal cones and the method of alternating projections: applications ⋮ A cyclic projection algorithm via duality ⋮ Transversality in variational analysis ⋮ Low-order control design for LMI problems using alternating projection methods

This page was built for publication: The method of projections for finding the common point of convex sets