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.
- A simple algorithm for computing projection onto intersection of finite level sets (Q260148) (← links)
- Distributed continuous-time approximate projection protocols for shortest distance optimization problems (Q286313) (← links)
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space (Q297551) (← links)
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces (Q312177) (← links)
- Single projection Kaczmarz extended algorithms (Q342879) (← links)
- Subgradient projection algorithms and approximate solutions of convex feasibility problems (Q364738) (← links)
- Restricted normal cones and the method of alternating projections: applications (Q368468) (← links)
- An improved first-order primal-dual algorithm with a new correction step (Q386446) (← links)
- Alternating projections on nontangential manifolds (Q387545) (← links)
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491) (← links)
- Extrapolation and local acceleration of an iterative process for common fixed point problems (Q442508) (← links)
- Asymptotic behavior of compositions of under-relaxed nonexpansive operators (Q482538) (← links)
- The method of alternating relaxed projections for two nonconvex sets (Q484479) (← links)
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes (Q486223) (← links)
- A strongly polynomial-time algorithm for the strict homogeneous linear-inequality feasibility problem (Q486939) (← links)
- Numerical methods for solving some matrix feasibility problems (Q509640) (← links)
- A note on alternating projections for ill-posed semidefinite feasibility problems (Q517318) (← links)
- The method of successive orthogonal projections for solving nonlinear simultaneous equations (Q579851) (← links)
- Incremental proximal methods for large scale convex optimization (Q644913) (← links)
- There is no variational characterization of the cycles in the method of periodic projections (Q652441) (← links)
- Optimal \(H_ \infty\) model reduction via linear matrix inequalities: continuous- and discrete-time cases (Q672224) (← links)
- About subtransversality of collections of sets (Q683294) (← links)
- The asymptotic behavior of the composition of two resolvents (Q707223) (← links)
- A generalized projection-based scheme for solving convex constrained optimization problems (Q721952) (← links)
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors (Q741092) (← links)
- Relaxed outer projections, weighted averages and convex feasibility (Q751771) (← links)
- Block-iterative methods for consistent and inconsistent linear equations (Q754606) (← links)
- Stochastic heavy-ball method for constrained stochastic optimization problems (Q778161) (← links)
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems (Q817152) (← links)
- Local linear convergence for alternating and averaged nonconvex projections (Q839655) (← links)
- Generalized pole placement via static output feedback: a methodology based on projections (Q858950) (← links)
- Transversality and alternating projections for nonconvex sets (Q895706) (← links)
- Method of successive projections for finding a common point of sets in metric spaces (Q911469) (← links)
- Iterative method for solving the linear feasibility problem (Q946322) (← links)
- Iterative methods for the computation of fixed points of demicontractive mappings (Q966099) (← links)
- On the regularity condition in a convex feasibility problem (Q1001865) (← links)
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin (Q1040681) (← links)
- Successive projections on hyperplanes (Q1058267) (← links)
- Convergence results for an accelerated nonlinear Cimmino algorithm (Q1061456) (← links)
- The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control (Q1069671) (← links)
- A parallel subgradient projections method for the convex feasibility problem (Q1091948) (← links)
- Incorporation of a priori moment information into signal recovery and synthesis problems (Q1092642) (← links)
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems (Q1107277) (← links)
- A finitely convergent ``row-action'' method for the convex feasibility problem (Q1109529) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- Parallel application of block-iterative methods in medical imaging and radiation therapy (Q1111951) (← links)
- A cyclic projection algorithm via duality (Q1123132) (← links)
- New methods for linear inequalities (Q1162118) (← links)
- Signal enhancement and the method of successive projections (Q1177139) (← links)
- On the convergence of Han's method for convex programming with quadratic objective (Q1181736) (← links)
