On the public citation graph
Error bounds for the method of alternating projections
0 signed · 108 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-1-4612-5700-4openalex-snapshot
A Short Introduction to Perturbation Theory for Linear Operators
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0openalex-snapshot
Parametric Optimization and Approximation
inferredcites →https://doi.org/10.1007/978-3-0348-6253-0_7openalex-snapshot
Rate of Convergence of the Method of Alternating Projections
inferredcites →https://doi.org/10.1007/bf01436376openalex-snapshot
Projection method for solving a singular system of linear equations and its applications
inferredcites →https://doi.org/10.1016/0022-247x(78)90214-7openalex-snapshot
The angles between the null spaces of X rays
inferredcites →https://doi.org/10.1090/s0002-9947-1937-1501907-0openalex-snapshot
On Certain Inequalities and Characteristic Value Problems for Analytic Functions and For Functions of Two Variables
inferredcites →https://doi.org/10.1090/s0002-9947-1950-0051437-7openalex-snapshot
Theory of reproducing kernels
inferredcites →https://doi.org/10.1090/s0002-9947-1967-0214135-5openalex-snapshot
On the Alternating Projections Theorem and Bivariate Stationary Stochastic Processes
inferredcites →https://doi.org/10.1109/proc.1983.12598openalex-snapshot
Finite series-expansion reconstruction methods
inferredcites →https://doi.org/10.1109/proc.1986.13459openalex-snapshot
Seismic borehole tomography—Theory and computational methods
inferredcites →https://doi.org/10.1109/tcs.1978.1084541openalex-snapshot
Generalized Image Restoration by the Method of Alternating Orthogonal Projections
inferredcites →https://doi.org/10.1137/0322010openalex-snapshot
New Results on the Interpolation Problem for Continuous-Time Stationary Increments Processes
inferredcites →https://doi.org/10.1137/1113049openalex-snapshot
A General Solution of a Problem in Linear Prediction of Stationary Processes
inferredcites →https://doi.org/10.18311/jims/1960/16934openalex-snapshot
Spectral Theory in Hilbert Space
inferredcites →https://doi.org/10.2307/1969463openalex-snapshot
On Rings of Operators. Reduction Theory
inferredcites →https://doi.org/10.24033/bsmf.90openalex-snapshot
Essai sur la géométrie à $n$ dimensions
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jath.1998.3174openalex-snapshot
Successive Approximate Algorithm for Best Approximation from a Polyhedron
inferred← citeshttps://doi.org/10.1006/jmaa.1997.5202openalex-snapshot
The Rate of Convergence for the Method of Alternating Projections, II
inferred← citeshttps://doi.org/10.1007/978-94-011-2634-2_5openalex-snapshot
The Method of Alternating Orthogonal Projections
inferred← citeshttps://doi.org/10.1007/978-94-015-8577-4_5openalex-snapshot
Dykstra’s Cyclic Projections Algorithm: The Rate of Convergence
inferred← citeshttps://doi.org/10.1007/978-94-015-8577-4_7openalex-snapshot
The Angle Between Subspaces of a Hilbert Space
inferred← citeshttps://doi.org/10.1007/bf00249640openalex-snapshot
Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
inferred← citeshttps://doi.org/10.1007/bf02551360openalex-snapshot
Oblique projections: Formulas, algorithms, and error bounds
inferred← citeshttps://doi.org/10.1007/bfb0113295openalex-snapshot
On a class of generalized gradient methods for solving locally lipschitz feasibility problems
inferred← citeshttps://doi.org/10.1007/s00025-017-0721-5openalex-snapshot
Non-optimality of the Greedy Algorithm for Subspace Orderings in the Method of Alternating Projections
inferred← citeshttps://doi.org/10.1007/s00041-009-9077-xopenalex-snapshot
A Note on the Behavior of the Randomized Kaczmarz Algorithm of Strohmer and Vershynin
inferred← citeshttps://doi.org/10.1007/s00211-012-0512-6openalex-snapshot
On the Meany inequality with applications to convergence analysis of several row-action iteration methods
inferred← citeshttps://doi.org/10.1007/s00211-021-01207-6openalex-snapshot
On the method of reflections
inferred← citeshttps://doi.org/10.1007/s00365-013-9213-3openalex-snapshot
Alternating Projections on Nontangential Manifolds
inferred← citeshttps://doi.org/10.1007/s00466-025-02735-wopenalex-snapshot
Phase-space iterative solvers
inferred← citeshttps://doi.org/10.1007/s10013-018-0279-xopenalex-snapshot
Implicit Error Bounds for Picard Iterations on Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s10107-019-01437-5openalex-snapshot
Worst-case complexity of cyclic coordinate descent: $$O(n^2)$$ gap with randomized version
inferred← citeshttps://doi.org/10.1007/s10589-021-00275-6openalex-snapshot
The circumcentered-reflection method achieves better rates than alternating projections
inferred← citeshttps://doi.org/10.1007/s10915-026-03474-7openalex-snapshot
A Composed Alternating Relaxed Projection Algorithm for Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1007/s11075-015-0085-4openalex-snapshot
Optimal Rates of Linear Convergence of Relaxed Alternating Projections and Generalized Douglas-Rachford Methods for Two Subspaces
inferred← citeshttps://doi.org/10.1007/s11075-017-0310-4openalex-snapshot
Convergence properties of dynamic string-averaging projection methods in the presence of perturbations
inferred← citeshttps://doi.org/10.1007/s11075-017-0399-5openalex-snapshot
Circumcentering the Douglas–Rachford method
inferred← citeshttps://doi.org/10.1007/s11075-018-0608-xopenalex-snapshot
Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
inferred← citeshttps://doi.org/10.1007/s11075-023-01533-wopenalex-snapshot
Polynomial estimates for the method of cyclic projections in Hilbert spaces
inferred← citeshttps://doi.org/10.1007/s11432-013-4841-6openalex-snapshot
Source localization based on symmetrical MUSIC and its statistical performance analysis
inferred← citeshttps://doi.org/10.1007/s40314-023-02211-2openalex-snapshot
Low-rank nonnegative tensor approximation via alternating projections and sketching
inferred← citeshttps://doi.org/10.1016/0377-0427(91)90012-9openalex-snapshot
A method for approximating the solution set of a system of convex inequalities by polytopes
inferred← citeshttps://doi.org/10.1016/0377-0427(92)00123-qopenalex-snapshot
Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
inferred← citeshttps://doi.org/10.1016/b978-0-444-50616-0.50014-2openalex-snapshot
The method of subspace corrections
inferred← citeshttps://doi.org/10.1016/j.crma.2009.11.018openalex-snapshot
A generalization of the Friedrichs angle and the method of alternating projections
inferred← citeshttps://doi.org/10.1016/j.csda.2013.03.024openalex-snapshot
OLS with multiple high dimensional category variables
inferred← citeshttps://doi.org/10.1016/j.jat.2006.02.005openalex-snapshot
The rate of convergence for the cyclic projections algorithm I: Angles between convex sets
inferred← citeshttps://doi.org/10.1016/j.jat.2006.02.006openalex-snapshot
The rate of convergence for the cyclic projections algorithm II: Norms of nonlinear operators
inferred← citeshttps://doi.org/10.1016/j.jat.2008.04.001openalex-snapshot
The rate of convergence for the cyclic projections algorithm III: Regularity of convex sets
inferred← citeshttps://doi.org/10.1016/j.jat.2009.12.007openalex-snapshot
Functions with prescribed best linear approximations
inferred← citeshttps://doi.org/10.1016/j.jat.2014.06.002openalex-snapshot
The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angle
inferred← citeshttps://doi.org/10.1016/j.jat.2016.02.001openalex-snapshot
Ritt operators and convergence in the method of alternating projections
inferred← citeshttps://doi.org/10.1016/j.jat.2017.08.005openalex-snapshot
The optimal error bound for the method of simultaneous projections
inferred← citeshttps://doi.org/10.1016/j.jat.2021.105648openalex-snapshot
Error bounds for the method of simultaneous projections with infinitely many subspaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2004.12.050openalex-snapshot
On the rate of convergence of the alternating projection method in finite dimensional spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2013.09.024openalex-snapshot
The numerical range and the spectrum of a product of two orthogonal projections
inferred← citeshttps://doi.org/10.1016/j.jmaa.2015.07.070openalex-snapshot
Generalized consistent sampling in abstract Hilbert spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2024.128925openalex-snapshot
Coordinate-update algorithms can efficiently detect infeasible optimization problems
inferred← citeshttps://doi.org/10.1016/j.laa.2020.05.023openalex-snapshot
On angles, projections and iterations
inferred← citeshttps://doi.org/10.1016/j.laa.2023.12.007openalex-snapshot
Comparing the methods of alternating and simultaneous projections for two subspaces
inferred← citeshttps://doi.org/10.1016/s0377-0427(00)00518-5openalex-snapshot
The method of subspace corrections
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80013-6openalex-snapshot
Accelerating the Convergence of the Method of Alternating Projections Via a Line Search: a Brief Survey
inferred← citeshttps://doi.org/10.1023/a:1022631928592openalex-snapshot
Convergence of Bregman Projection Methods for Solving Consistent Convex Feasibility Problems in Reflexive Banach Spaces
inferred← citeshttps://doi.org/10.1080/00207169008803865openalex-snapshot
On the behavior of a block-iterative projection method for solving convex feasibility problems
inferred← citeshttps://doi.org/10.1080/01630563.2011.591954openalex-snapshot
Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
inferred← citeshttps://doi.org/10.1080/01630569408816580openalex-snapshot
The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
inferred← citeshttps://doi.org/10.1080/01630569508816635openalex-snapshot
Strong convergence of expected-projection methods in hilbert spaces
inferred← citeshttps://doi.org/10.1080/02331934.2024.2444623openalex-snapshot
Douglas–Rachford is the best projection method in its family
inferred← citeshttps://doi.org/10.1080/03081080600743338openalex-snapshot
Subspaces, angles and pairs of orthogonal projections
inferred← citeshttps://doi.org/10.1090/s0002-9947-03-03136-2openalex-snapshot
Accelerating the convergence of the method of alternating projections
inferred← citeshttps://doi.org/10.1090/s0894-0347-02-00398-3openalex-snapshot
The method of alternating projections and the method of subspace corrections in Hilbert space
inferred← citeshttps://doi.org/10.1090/s1061-0022-2012-01202-1openalex-snapshot
The rate of convergence in the method of alternating projections
inferred← citeshttps://doi.org/10.1109/36.79426openalex-snapshot
Enhanced autoregressive moving average spectral estimation applied to the measurement of Doppler spectral width
inferred← citeshttps://doi.org/10.1109/5.214546openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/78.324732openalex-snapshot
Space-alternating generalized expectation-maximization algorithm
inferred← citeshttps://doi.org/10.1109/icassp.1991.151014openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/isssta.2004.1371792openalex-snapshot
Construction of equiangular signatures for synchronous CDMA systems
inferred← citeshttps://doi.org/10.1109/tit.2004.839492openalex-snapshot
Designing structured tight frames via an alternating projection method
inferred← citeshttps://doi.org/10.1109/tsp.2013.2243442openalex-snapshot
Low-Complexity DOA Estimation Based on Compressed MUSIC and Its Performance Analysis
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2008.00682.xopenalex-snapshot
Characterizing arbitrarily slow convergence in the method of alternating projections
inferred← citeshttps://doi.org/10.1137/0727078openalex-snapshot
The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces
inferred← citeshttps://doi.org/10.1137/19m1307329openalex-snapshot
Low Rank Pure Quaternion Approximation for Pure Quaternion Matrices
inferred← citeshttps://doi.org/10.1137/20m1358669openalex-snapshot
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
inferred← citeshttps://doi.org/10.1137/22m1483165openalex-snapshot
The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection
inferred← citeshttps://doi.org/10.1137/s1064827599361771openalex-snapshot
Fast Solution of the Radial Basis Function Interpolation Equations: Domain Decomposition Methods
inferred← citeshttps://doi.org/10.1214/24-aap2066openalex-snapshot
Analysis of two-component Gibbs samplers using the theory of two projections
inferred← citeshttps://doi.org/10.1214/aos/1176348251openalex-snapshot
Efficient Estimation of Linear Functionals of a Probability Measure $P$ with Known Marginal Distributions
inferred← citeshttps://doi.org/10.1287/moor.2016.0827openalex-snapshot
Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
inferred← citeshttps://doi.org/10.1515/jiip-2019-0021openalex-snapshot
Local convergence of the error-reduction algorithm for real-valued objects
inferred← citeshttps://doi.org/10.3150/21-bej1369openalex-snapshot
Convergence rates of two-component MCMC samplers
inferred← citeshttps://doi.org/10.35537/10915/2315openalex-snapshot
Proyecciones oblicuas y complementos de Schur
inferred← citeshttps://doi.org/10.3929/ethz-b-000456982openalex-snapshot
Solving Zero-Sum Games through Alternating Projections
inferred← citeshttps://doi.org/10.48550/arxiv.1403.1088openalex-snapshot
A theory of nonparametric regression in the presence of complex nuisance components
inferred← citeshttps://doi.org/10.48550/arxiv.1406.0052openalex-snapshot
Variable selection in high-dimensional additive models based on norms of projections
inferred← citeshttps://doi.org/10.48550/arxiv.1407.0671openalex-snapshot
Optimal rates of convergence of matrices with applications
inferred← citeshttps://doi.org/10.48550/arxiv.1704.00308openalex-snapshot
The Optimal Error Bound for the Method of Simultaneous Projections
inferred← citeshttps://doi.org/10.48550/arxiv.1707.03081openalex-snapshot
Nonasymptotic and asymptotic linear convergence of an almost cyclic SHQP Dykstra's algorithm for polyhedral problems
inferred← citeshttps://doi.org/10.48550/arxiv.1809.05858openalex-snapshot
The Method of Alternating Projections
inferred← citeshttps://doi.org/10.48550/arxiv.1908.00531openalex-snapshot
On the optimal error bound for the first step in the method of cyclic alternating projections
inferred← citeshttps://doi.org/10.48550/arxiv.2003.10324openalex-snapshot
Fast Alternating Projections on Manifolds Based on Tangent Spaces
inferred← citeshttps://doi.org/10.70675/f520b79az20e8z477cz9626za7242fe26083openalex-snapshot
Autour des projections orthogonales : image numérique, principe d’incertitude et problème du sous-espace invariant
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.