The method of projections for finding the common point of convex sets
From MaRDI portal
Publication:5597971
DOI10.1016/0041-5553(67)90113-9zbMATH Open0199.51002OpenAlexW2085440994WikidataQ59411106 ScholiaQ59411106MaRDI QIDQ5597971FDOQ5597971
Authors: L. G. Gurin, Eh. V. Rajk, 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
Cited In (only showing first 100 items - show all)
- Generalized pole placement via static output feedback: a methodology based on projections
- About subtransversality of collections of sets
- Row-Oriented Decomposition in Large-Scale Linear Optimization
- Cyclic projection methods on a class of nonconvex sets
- Envelope functions: unifications and further properties
- A class of optimized row projection methods for solving large nonsymmetric linear systems
- New iterative methods for linear inequalities
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- Convergence rate analysis for averaged fixed point iterations in common fixed point problems
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- A new algorithm for the minimax location problem with the closest distance
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- About intrinsic transversality of pairs of sets
- A projection method for semidefinite linear systems and its applications
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- Alternating convex projection methods for discrete-time covariance control design
- Phase retrieval via matrix completion
- The combination projection method for solving convex feasibility problems
- A projection scheme to stability analysis of discrete T-S fuzzy models.
- Alternating projections, remotest projections, and greedy approximation
- Error bounds for parametric polynomial systems with applications to higher-order stability analysis and convergence rates
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings
- Iterative algorithm for solving a class of convex feasibility problem
- Stochastic first-order methods with random constraint projection
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- On the linear convergence of circumcentered isometry methods
- Iterative solution of convex problems by fejer-monotone methods
- On the finite termination of the Douglas-Rachford method for the convex feasibility problem
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Signal enhancement and the method of successive projections
- Wavelet domain signal deconvolution with singularity-preserving regularization
- The Adaptive Projected Subgradient Method over the Fixed Point Set of Strongly Attracting Nonexpansive Mappings
- Adaptive Projected Subgradient Method for Asymptotic Minimization of Sequence of Nonnegative Convex Functions
- Stochastic heavy-ball method for constrained stochastic optimization problems
- Polyak's gradient method for split feasibility problem constrained by level sets
- Iterations of parallel convex projections in hilbert spaces
- Improved constraint consensus methods for seeking feasibility in nonlinear programs
- Alternating convex projection methods for covariance control design
- Set intersection problems: supporting hyperplanes and quadratic programming
- Des algorithmes pour le problème inverse des valeurs propres
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- Strong convergence of expected-projection methods in hilbert spaces
- Aggregation in intersection region for distributed heterogeneous mobile sensor networks
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- The projection method for solving nonlinear systems of equations under the most violated constraint control
- Iterative method for solving the linear feasibility problem
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
- Transversality in variational analysis
- Projection methods: an annotated bibliography of books and reviews
- Decomposition through formalization in a product space
- A generalized projection-based scheme for solving convex constrained optimization problems
- Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases
- A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
- A simple algorithm for computing projection onto intersection of finite level sets
- A finite steps algorithm for solving convex feasibility problems
- Cyclic subgradient projections
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization
- New methods for linear inequalities
- A multiprojection algorithm using Bregman projections in a product space
- Metric regularity -- a survey. II: Applications
- An acceleration scheme for cyclic subgradient projections method
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems
- Restricted normal cones and the method of alternating projections: applications
- Iterative methods for the computation of fixed points of demicontractive mappings
- On the regularity condition in a convex feasibility problem
- On the convergence of von Neumann's alternating projection algorithm for two sets
- On finitely convergent iterative methods for the convex feasibility problem
- Low-order control design for LMI problems using alternating projection methods
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Block-iterative methods for consistent and inconsistent linear equations
- Random Function Iterations for Consistent Stochastic Feasibility
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- The method of successive orthogonal projections for solving nonlinear simultaneous equations
- Local linear convergence for alternating and averaged nonconvex projections
- Stability analysis of discrete singular fuzzy systems
- Method of successive projections for finding a common point of sets in metric spaces
- The asymptotic behavior of the composition of two resolvents
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Incremental proximal methods for large scale convex optimization
- An alternating projection that does not converge in norm
- Relaxed outer projections, weighted averages and convex feasibility
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Summed squared distance error reduction by simultaneous multiprojections and applications
- A cyclic projection algorithm via duality
- Convergence results for an accelerated nonlinear Cimmino algorithm
- On the convergence of Han's method for convex programming with quadratic objective
- An acceleration scheme for Dykstra's algorithm
- A parallel subgradient projections method for the convex feasibility problem
- Strong convergence of a self-adaptive method for the split feasibility problem
- A complex projection scheme and applications
- Incorporation of a priori moment information into signal recovery and synthesis problems
- Solution of projection problems over polytopes
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- Randomized optimal consensus of multi-agent systems
This page was built for publication: The method of projections for finding the common point of convex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5597971)