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

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, New POCS algorithms for regularization of inverse problems, Algorithm implementation for distributed convex intersection computation, An improved first-order primal-dual algorithm with a new correction step, Alternating projections on nontangential manifolds, Randomized optimal consensus of multi-agent systems, Transversality and alternating projections for nonconvex sets, An acceleration scheme for cyclic subgradient projections method, Aggregation in intersection region for distributed heterogeneous mobile sensor networks, On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints, Method of successive projections for finding a common point of sets in metric spaces, Extrapolation and local acceleration of an iterative process for common fixed point problems, Alternating projections, remotest projections, and greedy approximation, New methods for linear inequalities, Incremental proximal methods for large scale convex optimization, There is no variational characterization of the cycles in the method of periodic projections, A projection scheme to stability analysis of discrete T-S fuzzy models., Signal enhancement and the method of successive projections, Envelope functions: unifications and further properties, Asymptotic behavior of compositions of under-relaxed nonexpansive operators, The method of alternating relaxed projections for two nonconvex sets, Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes, A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem, On the convergence of Han's method for convex programming with quadratic objective, Iterative algorithm for solving a class of convex feasibility problem, Solution of projection problems over polytopes, Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases, A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming, Iterative method for solving the linear feasibility problem, Finitely convergent iterative methods with overrelaxations revisited, About intrinsic transversality of pairs of sets, Numerical methods for solving some matrix feasibility problems, About subtransversality of collections of sets, Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks, A note on alternating projections for ill-posed semidefinite feasibility problems, A scratch covering algorithm using affine projection method, Strong convergence of a self-adaptive method for the split feasibility problem, Iterative methods for the computation of fixed points of demicontractive mappings, Piecewise linear retractions by reflexion, Stability analysis of discrete singular fuzzy systems, The asymptotic behavior of the composition of two resolvents, On the linear convergence of circumcentered isometry methods, Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces, A family of projection gradient methods for solving the multiple-sets split feasibility problem, The method of successive orthogonal projections for solving nonlinear simultaneous equations, Des algorithmes pour le problème inverse des valeurs propres, A generalized projection-based scheme for solving convex constrained optimization problems, On the regularity condition in a convex feasibility problem, Consensus in asynchronous multiagent systems. I: Asynchronous consensus models, Solving composite fixed point problems with block updates, Notes on flexible sequential block iterative methods, Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities, Subgradient projection algorithms for convex feasibility problems in the presence of computational errors, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Acceleration schemes for the method of alternating projections, Relaxed outer projections, weighted averages and convex feasibility, Block-iterative methods for consistent and inconsistent linear equations, A superlinearly convergent projection algorithm for solving the convex inequality problem, On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space, Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin, Stochastic heavy-ball method for constrained stochastic optimization problems, Random products of contractions in metric and Banach spaces, Successive projections on hyperplanes, On the convergence of von Neumann's alternating projection algorithm for two sets, Summed squared distance error reduction by simultaneous multiprojections and applications, Convergence results for an accelerated nonlinear Cimmino algorithm, Wavelet domain signal deconvolution with singularity-preserving regularization, The projection method for solving nonlinear systems of equations under the most violated constraint control, New iterative methods for linear inequalities, A simple algorithm for computing projection onto intersection of finite level sets, An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems, A class of optimized row projection methods for solving large nonsymmetric linear systems