Pages that link to "Item:Q5597971"
From MaRDI portal
The following pages link to The method of projections for finding the common point of convex sets (Q5597971):
Displaying 50 items.
- Solution of projection problems over polytopes (Q1185491) (← links)
- A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming (Q1188288) (← links)
- Des algorithmes pour le problème inverse des valeurs propres (Q1236410) (← links)
- Acceleration schemes for the method of alternating projections (Q1263944) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space (Q1272854) (← links)
- On the convergence of von Neumann's alternating projection algorithm for two sets (Q1308949) (← links)
- New iterative methods for linear inequalities (Q1321142) (← links)
- A multiprojection algorithm using Bregman projections in a product space (Q1344108) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces (Q1364216) (← links)
- A projection scheme to stability analysis of discrete T-S fuzzy models. (Q1428714) (← links)
- A class of optimized row projection methods for solving large nonsymmetric linear systems (Q1612435) (← links)
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems (Q1630420) (← links)
- The combination projection method for solving convex feasibility problems (Q1634718) (← links)
- Transversality in variational analysis (Q1673886) (← links)
- Aggregation in intersection region for distributed heterogeneous mobile sensor networks (Q1697751) (← links)
- Envelope functions: unifications and further properties (Q1730819) (← links)
- Iterative algorithm for solving a class of convex feasibility problem (Q1736385) (← links)
- About intrinsic transversality of pairs of sets (Q1745916) (← links)
- Stability analysis of discrete singular fuzzy systems (Q1770777) (← links)
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems (Q1803652) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- Random products of contractions in metric and Banach spaces (Q1839426) (← links)
- Summed squared distance error reduction by simultaneous multiprojections and applications (Q1855154) (← links)
- Wavelet domain signal deconvolution with singularity-preserving regularization (Q1861336) (← links)
- An alternating projection that does not converge in norm (Q1881089) (← links)
- A projection method for semidefinite linear systems and its applications (Q1888336) (← links)
- Steered sequential projections for the inconsistent convex feasibility problem (Q1888607) (← links)
- A parallel projection method based on sequential most remote set in convex feasibility problems (Q1907078) (← links)
- Alternating convex projection methods for discrete-time covariance control design (Q1908638) (← links)
- Low-order control design for LMI problems using alternating projection methods (Q1923044) (← links)
- New POCS algorithms for regularization of inverse problems (Q1923622) (← links)
- Randomized optimal consensus of multi-agent systems (Q1932692) (← links)
- An acceleration scheme for cyclic subgradient projections method (Q1938914) (← links)
- Distributed constrained stochastic subgradient algorithms based on random projection and asynchronous broadcast over networks (Q1992405) (← links)
- A scratch covering algorithm using affine projection method (Q1993383) (← links)
- On the linear convergence of circumcentered isometry methods (Q2021771) (← links)
- Solving composite fixed point problems with block updates (Q2042410) (← links)
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities (Q2044573) (← links)
- A real-time iterative projection scheme for solving the common fixed point problem and its applications (Q2168968) (← links)
- Algorithm implementation for distributed convex intersection computation (Q2179642) (← links)
- Alternating projections, remotest projections, and greedy approximation (Q2209301) (← links)
- Finitely convergent iterative methods with overrelaxations revisited (Q2239369) (← links)
- Strong convergence of a self-adaptive method for the split feasibility problem (Q2253220) (← links)
- Piecewise linear retractions by reflexion (Q2265339) (← links)
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces (Q2274154) (← links)
- A family of projection gradient methods for solving the multiple-sets split feasibility problem (Q2275325) (← links)
- Consensus in asynchronous multiagent systems. I: Asynchronous consensus models (Q2290394) (← links)
- Notes on flexible sequential block iterative methods (Q2293554) (← links)
