On the public citation graph
On the convergence of von Neumann's alternating projection algorithm for two sets
0 signed · 279 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.1002/zamm.19790590621openalex-snapshot
Ekeland, I. / Temam, R., Convex Analysis and Variational Problems. Amsterdam‐Oxford. North‐Holland Publ. Company. 1976. IX, 402 S., Dfl. 85.00. US $ 29.50 (SMAA 1)
inferredcites →https://doi.org/10.1006/jath.1994.1136openalex-snapshot
Dykstra′s Alternating Projection Algorithm for Two Sets
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/978-94-011-2634-2_5openalex-snapshot
The Method of Alternating Orthogonal Projections
inferredcites →https://doi.org/10.1007/978-94-017-2217-9_5openalex-snapshot
A Survey of Convergence Results for Maximum Entropy Methods
inferredcites →https://doi.org/10.1007/bf00938588openalex-snapshot
Stability and regular points of inequality systems
inferredcites →https://doi.org/10.1007/bf01581072openalex-snapshot
Partially finite convex programming, Part I: Quasi relative interiors and duality theory
inferredcites →https://doi.org/10.1007/bf01581073openalex-snapshot
Partially finite convex programming, Part II: Explicit lattice models
inferredcites →https://doi.org/10.1007/bf02612715openalex-snapshot
Decomposition through formalization in a product space
inferredcites →https://doi.org/10.1007/bfb0084502openalex-snapshot
Mathematical Methods in Tomography
inferredcites →https://doi.org/10.1007/bfb0084514openalex-snapshot
On variable block algebraic reconstruction techniques
inferredcites →https://doi.org/10.1016/0022-247x(86)90085-5openalex-snapshot
On the von Neumann alternating algorithm in Hilbert space
inferredcites →https://doi.org/10.1016/0041-5553(67)90113-9openalex-snapshot
The method of projections for finding the common point of convex sets
inferredcites →https://doi.org/10.1016/c2009-0-19672-1openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1017/s0013091500022318openalex-snapshot
Absolute norms on vector lattices
inferredcites →https://doi.org/10.1049/sqj.1970.0088openalex-snapshot
Optimization by Vector Space Methods
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.1137/1.9781611971088openalex-snapshot
Convex Analysis and Variational Problems
inferredcites →https://doi.org/10.1287/moor.1.2.130openalex-snapshot
Regularity and Stability for Convex Multivalued Functions
inferredcites →https://doi.org/10.4153/cjm-1954-038-xopenalex-snapshot
The Relaxation Method for Linear Inequalities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cnm.2733openalex-snapshot
Energy minimization in medical image analysis: Methodologies and applications
inferred← citeshttps://doi.org/10.1006/jath.1994.1136openalex-snapshot
Dykstra′s Alternating Projection Algorithm for Two Sets
inferred← citeshttps://doi.org/10.1006/jmaa.1996.0308openalex-snapshot
The Approximation of Fixed Points of Compositions of Nonexpansive Mappings in Hilbert Space
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/0-387-29550-x_8openalex-snapshot
Fluence Map Optimization in IMRT Cancer Treatment Planning and A Geometric Approach
inferred← citeshttps://doi.org/10.1007/978-3-030-91059-4_4openalex-snapshot
Row-Oriented Decomposition in Large-Scale Linear Optimization
inferred← citeshttps://doi.org/10.1007/978-3-031-97638-4_27openalex-snapshot
Numerical Assessment of Alternating Projection Methods for Matrix Completion with Application to Sparse Image Reconstruction
inferred← citeshttps://doi.org/10.1007/978-3-319-33255-0_10openalex-snapshot
Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4_3openalex-snapshot
Convergence of Iterative Methods
inferred← citeshttps://doi.org/10.1007/978-3-642-30901-4_4openalex-snapshot
Algorithmic Projection Operators
inferred← citeshttps://doi.org/10.1007/978-94-015-8577-4_23openalex-snapshot
On the Order Monotonicity of the Metric Projection Operator
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/bf02647947openalex-snapshot
Unique reconstruction of band-limited signals by a Mallat-Zhong wavelet transform algorithm
inferred← citeshttps://doi.org/10.1007/s00186-024-00866-zopenalex-snapshot
How to project onto the intersection of a closed affine subspace and a hyperplane
inferred← citeshttps://doi.org/10.1007/s00199-019-01232-5openalex-snapshot
Emergence of price-taking Behavior
inferred← citeshttps://doi.org/10.1007/s00245-017-9417-1openalex-snapshot
Linear Regularity and Linear Convergence of Projection-Based Methods for Solving Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1007/s00365-013-9213-3openalex-snapshot
Alternating Projections on Nontangential Manifolds
inferred← citeshttps://doi.org/10.1007/s10013-013-0049-8openalex-snapshot
The Method of Alternating Relaxed Projections for Two Nonconvex Sets
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/s10013-019-00357-3openalex-snapshot
Local Linear Convergence for Inexact Alternating Projections on Nonconvex Sets
inferred← citeshttps://doi.org/10.1007/s10107-003-0464-9openalex-snapshot
Regularities and their relations to error bounds
inferred← citeshttps://doi.org/10.1007/s10107-014-0759-zopenalex-snapshot
Set intersection problems: supporting hyperplanes and quadratic programming
inferred← citeshttps://doi.org/10.1007/s10107-015-0963-5openalex-snapshot
Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
inferred← citeshttps://doi.org/10.1007/s10107-016-1039-xopenalex-snapshot
Set regularities and feasibility problems
inferred← citeshttps://doi.org/10.1007/s10107-016-1048-9openalex-snapshot
A note on alternating projections for ill-posed semidefinite feasibility problems
inferred← citeshttps://doi.org/10.1007/s10107-018-1343-8openalex-snapshot
Necessary conditions for linear convergence of iterated expansive, set-valued mappings
inferred← citeshttps://doi.org/10.1007/s10107-022-01809-4openalex-snapshot
Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
inferred← citeshttps://doi.org/10.1007/s10107-023-01978-wopenalex-snapshot
On the centralization of the circumcentered-reflection method
inferred← citeshttps://doi.org/10.1007/s10107-026-02332-6openalex-snapshot
Concrete convergence rates for common fixed point problems under Karamata regularity
inferred← citeshttps://doi.org/10.1007/s10107-026-02374-wopenalex-snapshot
Characterization of regularity via variational stability of alternating projection sequences
inferred← citeshttps://doi.org/10.1007/s101070050083openalex-snapshot
Strong conical hull intersection property, bounded linear regularity, Jameson's property (G), and error bounds in convex optimization
inferred← citeshttps://doi.org/10.1007/s10208-008-9036-yopenalex-snapshot
Local Linear Convergence for Alternating and Averaged Nonconvex Projections
inferred← citeshttps://doi.org/10.1007/s10208-015-9279-3openalex-snapshot
Transversality and Alternating Projections for Nonconvex Sets
inferred← citeshttps://doi.org/10.1007/s10589-007-9073-5openalex-snapshot
How good are projection methods for convex feasibility problems?
inferred← citeshttps://doi.org/10.1007/s10589-015-9750-8openalex-snapshot
AAR-based decomposition algorithm for non-linear convex optimisation
inferred← citeshttps://doi.org/10.1007/s10589-017-9915-8openalex-snapshot
Peaceman–Rachford splitting for a class of nonconvex optimization problems
inferred← citeshttps://doi.org/10.1007/s10589-017-9942-5openalex-snapshot
A new projection method for finding the closest point in the intersection of convex sets
inferred← citeshttps://doi.org/10.1007/s10589-018-0021-3openalex-snapshot
Finding a best approximation pair of points for two polyhedra
inferred← citeshttps://doi.org/10.1007/s10589-019-00155-0openalex-snapshot
The block-wise circumcentered–reflection method
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/s10589-021-00293-4openalex-snapshot
Alternating conditional gradient method for convex feasibility problems
inferred← citeshttps://doi.org/10.1007/s10589-021-00324-0openalex-snapshot
Finding best approximation pairs for two intersections of closed convex sets
inferred← citeshttps://doi.org/10.1007/s10589-023-00516-wopenalex-snapshot
A successive centralized circumcentered-reflection method for the convex feasibility problem
inferred← citeshttps://doi.org/10.1007/s10898-021-01025-yopenalex-snapshot
A variational approach to the alternating projections method
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/s10957-013-0381-xopenalex-snapshot
A Cyclic Douglas–Rachford Iteration Scheme
inferred← citeshttps://doi.org/10.1007/s10957-013-0488-0openalex-snapshot
Recent Results on Douglas–Rachford Methods for Combinatorial Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-014-0556-0openalex-snapshot
Quantitative Characterizations of Regularity Properties of Collections of Sets
inferred← citeshttps://doi.org/10.1007/s10957-015-0716-xopenalex-snapshot
On the Existence of Minimizers of Proximity Functions for Split Feasibility Problems
inferred← citeshttps://doi.org/10.1007/s10957-017-1130-3openalex-snapshot
Transversality in Variational Analysis
inferred← citeshttps://doi.org/10.1007/s10957-019-01564-1openalex-snapshot
Convergence Analysis of the Generalized Splitting Methods for a Class of Nonconvex Optimization Problems
inferred← citeshttps://doi.org/10.1007/s10957-024-02386-6openalex-snapshot
On the Relationship Between the Kurdyka–Łojasiewicz Property and Error Bounds on Hadamard Manifolds
inferred← citeshttps://doi.org/10.1007/s10957-025-02742-0openalex-snapshot
Fréchet BCQ and Error Bounds for A System of Finitely Many Inequalities
inferred← citeshttps://doi.org/10.1007/s10957-025-02763-9openalex-snapshot
General Perturbation Resilient Dynamic String-Averaging for Inconsistent Problems with Superiorization
inferred← citeshttps://doi.org/10.1007/s10957-025-02887-yopenalex-snapshot
Hierarchical Variational Inequality Problem for Noncooperative Game-Theoretic Selection of Generalized Nash Equilibrium
inferred← citeshttps://doi.org/10.1007/s10957-026-02935-1openalex-snapshot
Convergence of Linearized Proximal Algorithms with Adaptive Stepsizes for Convex Composite Optimization
inferred← citeshttps://doi.org/10.1007/s10957-026-02951-1openalex-snapshot
On a Robust Approach to “split” Feasibility Problems: Solvability and Global Error Bound Conditions
inferred← citeshttps://doi.org/10.1007/s11075-004-5882-0openalex-snapshot
Alternating oblique projections for coupled linear systems
inferred← citeshttps://doi.org/10.1007/s11075-015-0045-zopenalex-snapshot
A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
inferred← citeshttps://doi.org/10.1007/s11075-016-0155-2openalex-snapshot
Numerical methods for solving some matrix feasibility problems
inferred← citeshttps://doi.org/10.1007/s11075-022-01308-9openalex-snapshot
The method of cyclic projections for closed convex sets in a Hilbert space under the presence of computational errors
inferred← citeshttps://doi.org/10.1007/s11075-026-02363-2openalex-snapshot
Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators
inferred← citeshttps://doi.org/10.1007/s11128-015-1024-yopenalex-snapshot
Projection methods for quantum channel construction
inferred← citeshttps://doi.org/10.1007/s11228-013-0238-3openalex-snapshot
Restricted Normal Cones and the Method of Alternating Projections: Applications
inferred← citeshttps://doi.org/10.1007/s11228-015-0322-yopenalex-snapshot
Bilateral Exchange and Competitive Equilibrium
inferred← citeshttps://doi.org/10.1007/s11228-016-0372-9openalex-snapshot
Monotonicity and Market Equilibrium
inferred← citeshttps://doi.org/10.1007/s11228-017-0436-5openalex-snapshot
About Subtransversality of Collections of Sets
inferred← citeshttps://doi.org/10.1007/s11228-017-0446-3openalex-snapshot
About Intrinsic Transversality of Pairs of Sets
inferred← citeshttps://doi.org/10.1007/s11228-020-00531-7openalex-snapshot
Some New Characterizations of Intrinsic Transversality in Hilbert Spaces
inferred← citeshttps://doi.org/10.1007/s11228-021-00602-3openalex-snapshot
Regularity and Stability for a Convex Feasibility Problem
inferred← citeshttps://doi.org/10.1007/s11228-023-00678-zopenalex-snapshot
Resolvent and Proximal Compositions
inferred← citeshttps://doi.org/10.1007/s11228-024-00727-1openalex-snapshot
Subtransversality and Strong CHIP of Closed Sets in Asplund Spaces
inferred← citeshttps://doi.org/10.1007/s11276-022-02961-7openalex-snapshot
Joint beamforming and power allocation for intelligent reflecting surface-aided millimeter wave MIMO systems
inferred← citeshttps://doi.org/10.1007/s11590-025-02196-3openalex-snapshot
Expansions of the characteristic polynomial of a perturbed PSD matrix and convergence analysis of alternating projections for the PSD cone and a line
inferred← citeshttps://doi.org/10.1007/s11784-013-0097-4openalex-snapshot
A note on alternating projections in Hilbert space
inferred← citeshttps://doi.org/10.1007/s11784-015-0256-xopenalex-snapshot
Iterative methods for solving variational inequalities in Euclidean space
inferred← citeshttps://doi.org/10.1007/s11784-026-01333-4openalex-snapshot
A new theorem of alternatives leading to sufficient conditions for the superiorization guarantee question of Dynamic String-Averaging in the inconsistent case
inferred← citeshttps://doi.org/10.1007/s11856-019-1870-xopenalex-snapshot
Moduli of regularity and rates of convergence for Fejér monotone sequences
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.1007/s40819-025-01950-6openalex-snapshot
Convergence of Fixed Points for Relatively Nonexpansive Mappings via Ishikawa Iteration
inferred← citeshttps://doi.org/10.1016/b978-0-12-822726-8.00014-2openalex-snapshot
“Early” Constrained Reconstruction Methods
inferred← citeshttps://doi.org/10.1016/j.amc.2021.126425openalex-snapshot
A parameterized Douglas–Rachford splitting algorithm for nonconvex optimization
inferred← citeshttps://doi.org/10.1016/j.birob.2026.100301openalex-snapshot
Safe expeditious whole-body control of mobile manipulators for collision avoidance
inferred← citeshttps://doi.org/10.1016/j.jappgeo.2017.01.031openalex-snapshot
A POCS method for iterative deblending constrained by a blending mask
inferred← citeshttps://doi.org/10.1016/j.jat.2004.02.006openalex-snapshot
Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
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.2013.07.012openalex-snapshot
Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
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.jat.2024.106045openalex-snapshot
The alternating simultaneous Halpern–Lions–Wittmann–Bauschke algorithm for finding the best approximation pair for two disjoint intersections of convex sets
inferred← citeshttps://doi.org/10.1016/j.jfa.2011.09.001openalex-snapshot
All Schatten spaces endowed with the Schur product are Q-algebras
inferred← citeshttps://doi.org/10.1016/j.jfa.2011.09.002openalex-snapshot
There is no variational characterization of the cycles in the method of periodic projections
inferred← citeshttps://doi.org/10.1016/j.jmaa.2009.07.012openalex-snapshot
Metric subregularity and the proximal point method
inferred← citeshttps://doi.org/10.1016/j.jmaa.2011.06.079openalex-snapshot
Alternating projections in CAT(0) spaces
inferred← citeshttps://doi.org/10.1016/j.jmaa.2014.02.028openalex-snapshot
About [ q ] -regularity properties of collections of sets
inferred← citeshttps://doi.org/10.1016/j.jmaa.2014.06.075openalex-snapshot
Linear and strong convergence of algorithms involving averaged nonexpansive operators
inferred← citeshttps://doi.org/10.1016/j.jmaa.2016.10.040openalex-snapshot
Regularity properties of non-negative sparsity sets
inferred← citeshttps://doi.org/10.1016/j.jmaa.2019.123482openalex-snapshot
On the rate of convergence of iterated Bregman projections and of the alternating algorithm
inferred← citeshttps://doi.org/10.1016/j.laa.2005.10.006openalex-snapshot
Computational acceleration of projection algorithms for the linear best approximation problem
inferred← citeshttps://doi.org/10.1016/j.laa.2007.09.037openalex-snapshot
Dose-volume-based IMRT fluence optimization: A fast least-squares approach with differentiability
inferred← citeshttps://doi.org/10.1016/j.laa.2015.06.019openalex-snapshot
On biunimodular vectors for unitary matrices
inferred← citeshttps://doi.org/10.1016/j.na.2003.10.010openalex-snapshot
Projection and proximal point methods: convergence results and counterexamples
inferred← citeshttps://doi.org/10.1016/j.na.2004.07.054openalex-snapshot
The asymptotic behavior of the composition of two resolvents
inferred← citeshttps://doi.org/10.1016/j.na.2008.02.091openalex-snapshot
On the regularity condition in a convex feasibility problem
inferred← citeshttps://doi.org/10.1016/j.na.2011.04.024openalex-snapshot
Compositions and averages of two resolvents: Relative geometry of fixed points sets and a partial answer to a question by C. Byrne
inferred← citeshttps://doi.org/10.1016/j.na.2013.03.018openalex-snapshot
Asymptotic behavior of averaged and firmly nonexpansive mappings in geodesic spaces
inferred← citeshttps://doi.org/10.1016/j.orl.2016.02.001openalex-snapshot
Approximating the minimum rank of a graph via alternating projection
inferred← citeshttps://doi.org/10.1016/j.orl.2021.04.009openalex-snapshot
A note on the finite convergence of alternating projections
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80003-3openalex-snapshot
Projection Algorithms: Results and Open Problems
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.1017/s1446181114000145openalex-snapshot
DOUGLAS–RACHFORD FEASIBILITY METHODS FOR MATRIX COMPLETION PROBLEMS
inferred← citeshttps://doi.org/10.1023/a:1006692403058openalex-snapshot
On the Property of Four Elements in Modular Spaces
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/02331934.2011.632502openalex-snapshot
Maximum entropy and feasibility methods for convex and nonconvex inverse problems
inferred← citeshttps://doi.org/10.1080/02331934.2012.679940openalex-snapshot
Gradient differences and bilateral barters
inferred← citeshttps://doi.org/10.1080/02331934.2014.947499openalex-snapshot
Norm convergence of realistic projection and reflection methods
inferred← citeshttps://doi.org/10.1080/02331934.2016.1209674openalex-snapshot
On the finite termination of the Douglas-Rachford method for the convex feasibility problem
inferred← citeshttps://doi.org/10.1080/02331934.2016.1227980openalex-snapshot
Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
inferred← citeshttps://doi.org/10.1080/02331934.2018.1474355openalex-snapshot
On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
inferred← citeshttps://doi.org/10.1080/02331934.2019.1583752openalex-snapshot
Generalized gradients, bid–ask spreads, and market equilibrium
inferred← citeshttps://doi.org/10.1080/02331934.2021.1901899openalex-snapshot
Necessary conditions for non-intersection of collections of sets
inferred← citeshttps://doi.org/10.1080/02331934.2021.1906873openalex-snapshot
On applications of the calmness moduli for multifunctions to error bounds
inferred← citeshttps://doi.org/10.1080/02331934.2023.2282175openalex-snapshot
Conic cancellation laws and some applications in set optimization
inferred← citeshttps://doi.org/10.1080/02331934.2025.2566121openalex-snapshot
Sufficient conditions for error bounds of inequalities and applications in Hilbert spaces
inferred← citeshttps://doi.org/10.1080/10556780903191165openalex-snapshot
Projection methods for conic feasibility problems: applications to polynomial sum-of-squares decompositions
inferred← citeshttps://doi.org/10.1080/10556788.2014.902056openalex-snapshot
Distributed solutions for loosely coupled feasibility problems using proximal splitting methods
inferred← citeshttps://doi.org/10.1088/0266-5611/21/1/004openalex-snapshot
Relaxed averaged alternating reflections for diffraction imaging
inferred← citeshttps://doi.org/10.1088/0266-5611/24/6/065014openalex-snapshot
A proximal decomposition method for solving convex variational inverse problems
inferred← citeshttps://doi.org/10.1088/0266-5611/32/10/105007openalex-snapshot
On stable finite dimensional approximation of conditionally well-posed inverse problems
inferred← citeshttps://doi.org/10.1090/conm/568/11272openalex-snapshot
Sensitivity Estimates Via Lyapunov Functions and Lyapunov Metrics
inferred← citeshttps://doi.org/10.1090/mcom/4026openalex-snapshot
An efficient algorithm for the ℓ_{𝑝} norm based metric nearness problem
inferred← citeshttps://doi.org/10.1090/mcom/4267openalex-snapshot
New operator designs for Halpern iterations with explicit rates under Hölder error bounds
inferred← citeshttps://doi.org/10.1090/proc/17373openalex-snapshot
A note on the moment problem for codimension greater than 1
inferred← citeshttps://doi.org/10.1090/s0002-9939-05-07719-1openalex-snapshot
A new proximal point iteration that converges weakly but not in norm
inferred← citeshttps://doi.org/10.1090/s0002-9947-05-03945-0openalex-snapshot
Strong CHIP, normality, and linear regularity of convex sets
inferred← citeshttps://doi.org/10.1103/physrevresearch.7.013211openalex-snapshot
Projective purification of correlated reduced density matrices
inferred← citeshttps://doi.org/10.1109/acssc.2018.8645087openalex-snapshot
Array Shape Calibration Using Low Rank Projections
inferred← citeshttps://doi.org/10.1109/cdc.1998.758213openalex-snapshot
Computation of l/sub 1/ optimal controllers using H/sub 2/ projections
inferred← citeshttps://doi.org/10.1109/cdc.2016.7798275openalex-snapshot
Global linear convergence in operator splitting methods
inferred← citeshttps://doi.org/10.1109/cdc40024.2019.9029991openalex-snapshot
A Privacy-preserving Disaggregation Algorithm for Non-intrusive Management of Flexible Energy
inferred← citeshttps://doi.org/10.1109/icassp.2019.8682920openalex-snapshot
Gridless DOA Estimation via. Alternating Projections
inferred← citeshttps://doi.org/10.1109/iscid.2011.117openalex-snapshot
The Linear Regular of Infinitely Many Sets
inferred← citeshttps://doi.org/10.1109/lgrs.2013.2261276openalex-snapshot
On Using Projection Onto Convex Sets for Solving the Hyperspectral Unmixing Problem
inferred← citeshttps://doi.org/10.1109/lra.2026.3655272openalex-snapshot
A Differentiable Distance Metric for Robotics Through Generalized Alternating Projection
inferred← citeshttps://doi.org/10.1109/taes.2021.3061811openalex-snapshot
Waveform Optimization for Multistatic Radar Imaging Using Mutual Information
inferred← citeshttps://doi.org/10.1109/taes.2024.3519492openalex-snapshot
Efficient Algorithms for Designing Sparse Linear Arrays With Desired Beampattern for Dual-Function Radar and Communication Systems
inferred← citeshttps://doi.org/10.1109/tcst.2024.3372802openalex-snapshot
Control Barrier Functions With Circulation Inequalities
inferred← citeshttps://doi.org/10.1109/tro.2024.3400924openalex-snapshot
Smooth Distances for Second-Order Kinematic Robot Control
inferred← citeshttps://doi.org/10.1109/tsp.2011.2163066openalex-snapshot
Optimal Distributed Beamforming for MISO Interference Channels
inferred← citeshttps://doi.org/10.1109/tsp.2014.2339801openalex-snapshot
Alternating Projections and Douglas-Rachford for Sparse Affine Feasibility
inferred← citeshttps://doi.org/10.1109/tsp.2021.3068353openalex-snapshot
Gridless DOA Estimation and Root-MUSIC for Non-Uniform Linear Arrays
inferred← citeshttps://doi.org/10.1109/tvt.2024.3363008openalex-snapshot
Enhanced DOA Estimation Through Coprime Planar Coarray Interpolation via Alternating Projection
inferred← citeshttps://doi.org/10.1111/cgf.13255openalex-snapshot
Fast Planar Harmonic Deformations with Alternating Tangential Projections
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.1111/j.1475-3995.2009.00693.xopenalex-snapshot
From convex feasibility to convex constrained optimization using block action projection methods and underrelaxation
inferred← citeshttps://doi.org/10.1134/s0081543823060160openalex-snapshot
A Bicomposition of Conical Projections
inferred← citeshttps://doi.org/10.1134/s1990478922030152openalex-snapshot
Modeling and Optimizing Large-Scale Production-Level Transportation Systems
inferred← citeshttps://doi.org/10.1134/s1995423918040043openalex-snapshot
Clustering Effect for Stationary Points of Discrepancy Functionals Associated with Conditionally Well-Posed Inverse Problems
inferred← citeshttps://doi.org/10.1137/070681399openalex-snapshot
Finding Best Approximation Pairs Relative to a Convex and Prox-Regular Set in a Hilbert Space
inferred← citeshttps://doi.org/10.1137/090754297openalex-snapshot
A Parallel Splitting Method for Coupled Monotone Inclusions
inferred← citeshttps://doi.org/10.1137/130919052openalex-snapshot
Analysis of the Convergence Rate for the Cyclic Projection Algorithm Applied to Basic Semialgebraic Convex Sets
inferred← citeshttps://doi.org/10.1137/130941493openalex-snapshot
The Dual Normal CHIP and Linear Regularity for Infinite Systems of Convex Sets in Banach Spaces
inferred← citeshttps://doi.org/10.1137/14099961xopenalex-snapshot
Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds
inferred← citeshttps://doi.org/10.1137/15m1045223openalex-snapshot
Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems
inferred← citeshttps://doi.org/10.1137/18m1192366openalex-snapshot
A Variational Image Segmentation Model Based on Normalized Cut with Adaptive Similarity and Spatial Regularization
inferred← citeshttps://doi.org/10.1137/18m1192615openalex-snapshot
Calmness and the Abadie CQ for Multifunctions and Linear Regularity for a Collection of Closed Sets
inferred← citeshttps://doi.org/10.1137/19m127879xopenalex-snapshot
A Privacy-Preserving Method to Optimize Distributed Resource Allocation
inferred← citeshttps://doi.org/10.1137/20m1358669openalex-snapshot
Infeasibility and Error Bound Imply Finite Convergence of Alternating Projections
inferred← citeshttps://doi.org/10.1137/21m1431576openalex-snapshot
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature
inferred← citeshttps://doi.org/10.1137/23m1567503openalex-snapshot
Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
inferred← citeshttps://doi.org/10.1137/23m1595412openalex-snapshot
A Finitely Convergent Circumcenter Method for the Convex Feasibility Problem
inferred← citeshttps://doi.org/10.1137/s003614450139075openalex-snapshot
Optical Wavefront Reconstruction: Theory and Numerical Methods
inferred← citeshttps://doi.org/10.1137/s0036144593251710openalex-snapshot
On Projection Algorithms for Solving Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1137/s1052623402410557openalex-snapshot
Iterating Bregman Retractions
inferred← citeshttps://doi.org/10.1145/3102304.3102315openalex-snapshot
Robust Localization in Wireless Sensor Networks via Low-rank and 'Sparse Matrix Decomposition
inferred← citeshttps://doi.org/10.1155/2020/8821553openalex-snapshot
Approximation of Fixed Points and Best Proximity Points of Relatively Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1155/2022/5537768openalex-snapshot
Thakur’s Iterative Scheme for Approximating Common Fixed Points to a Pair of Relatively Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1155/s108533750321201xopenalex-snapshot
Iterative algorithms with seminorm‐induced oblique projections
inferred← citeshttps://doi.org/10.11650/twjm/1500405612openalex-snapshot
ABOUT STATIONARITY AND REGULARITY IN VARIATIONAL ANALYSIS
inferred← citeshttps://doi.org/10.1186/s13663-021-00694-4openalex-snapshot
String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
inferred← citeshttps://doi.org/10.1186/s13663-021-00711-6openalex-snapshot
Circumcentering approximate reflections for solving the convex feasibility problem
inferred← citeshttps://doi.org/10.1186/s40535-014-0002-2openalex-snapshot
Projection-embedded BYY learning algorithm for Gaussian mixture-based clustering
inferred← citeshttps://doi.org/10.1201/b16485openalex-snapshot
Iterative Optimization in Inverse Problems
inferred← citeshttps://doi.org/10.12677/aam.2021.106230openalex-snapshot
Alternating Method for Symmetric Stochastic Inverse Eigenvalue Problems
inferred← citeshttps://doi.org/10.1287/moor.1070.0291openalex-snapshot
Alternating Projections on Manifolds
inferred← citeshttps://doi.org/10.1287/moor.1100.0456openalex-snapshot
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
inferred← citeshttps://doi.org/10.1287/moor.2016.0827openalex-snapshot
Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
showing the first 200 of 257 · page through all 257
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.