On the public citation graph

Two generalizations of Dykstra’s cyclic projections algorithm

https://doi.org/10.1007/bf02614621
0 signed · 40 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800040113openalex-snapshot
A quadratic programming procedure
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-1-4613-9940-7openalex-snapshot
Advances in Order Restricted Statistical Inference
inferredcites →https://doi.org/10.1007/978-1-4613-9940-7_3openalex-snapshot
A Method for Finding Projections onto the Intersection of Convex Sets in Hilbert Spaces
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/bf01580719openalex-snapshot
A successive projection method
inferredcites →https://doi.org/10.1007/bf01580851openalex-snapshot
On the convergence properties of Hildreth's quadratic programming algorithm
inferredcites →https://doi.org/10.1007/bf01582891openalex-snapshot
On the convergence of Han's method for convex programming with quadratic objective
inferredcites →https://doi.org/10.1007/bf02614077openalex-snapshot
A cyclic projection algorithm via duality
inferredcites →https://doi.org/10.1016/s0304-0208(08)72812-3openalex-snapshot
Iterative Methods for the Convex Feasibility Problem
inferredcites →https://doi.org/10.1080/01621459.1983.10477029openalex-snapshot
An Algorithm for Restricted Least Squares Regression
inferredcites →https://doi.org/10.1080/01630569408816580openalex-snapshot
The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
inferredcites →https://doi.org/10.1137/s0036144593251710openalex-snapshot
On Projection Algorithms for Solving Convex Feasibility Problems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4419-9569-8_11openalex-snapshot
Arbitrarily Slow Convergence of Sequences of Linear Operators: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_143-1openalex-snapshot
Dykstra’s Algorithm and Robust Stopping Criteria
inferred← citeshttps://doi.org/10.1007/s10589-015-9768-yopenalex-snapshot
An acceleration scheme for Dykstra’s algorithm
inferred← citeshttps://doi.org/10.1007/s10957-019-01512-zopenalex-snapshot
Dykstra’s Splitting and an Approximate Proximal Point Algorithm for Minimizing the Sum of Convex Functions
inferred← citeshttps://doi.org/10.1007/springerreference_72221openalex-snapshot
Dykstra's Algorithm and Robust Stopping Criteria
inferred← citeshttps://doi.org/10.1016/j.jat.2003.08.004openalex-snapshot
Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces
inferred← citeshttps://doi.org/10.1016/j.jat.2010.05.002openalex-snapshot
Slow convergence of sequences of linear operators II: Arbitrarily slow convergence
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.2014.11.035openalex-snapshot
Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
inferred← citeshttps://doi.org/10.1016/s1570-579x(01)80028-8openalex-snapshot
The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1017/s0003445272007585openalex-snapshot
Universidad Central de Venezuela
inferred← citeshttps://doi.org/10.1023/a:1022658308898openalex-snapshot
Fenchel Duality and the Strong Conical Hull Intersection Property
inferred← citeshttps://doi.org/10.1080/01630569808816813openalex-snapshot
Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings
inferred← citeshttps://doi.org/10.1080/01630569808816822openalex-snapshot
Quadratic optimization of fixed points of nonexpansive mappings in hubert space
inferred← citeshttps://doi.org/10.1080/02331930008844513openalex-snapshot
Dykstras algorithm with bregman projections: A convergence proof
inferred← citeshttps://doi.org/10.1080/10556780410001654223openalex-snapshot
Non-Convex feasibility problems and proximal point methods
inferred← citeshttps://doi.org/10.1103/q2nb-zg9mopenalex-snapshot
Agnostic Process Tomography
inferred← citeshttps://doi.org/10.1137/18m1168297openalex-snapshot
Distributed Deterministic Asynchronous Algorithms in Time-Varying Graphs Through Dykstra Splitting
inferred← citeshttps://doi.org/10.1137/23m1545781openalex-snapshot
Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
inferred← citeshttps://doi.org/10.1364/josaa.19.001334openalex-snapshot
Phase retrieval, error reduction algorithm, and Fienup variants: a view from convex optimization
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.1709.09499openalex-snapshot
Dykstra splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
inferred← citeshttps://doi.org/10.48550/arxiv.1806.07734openalex-snapshot
Subdifferentiable functions and partial data communication in a distributed deterministic asynchronous Dykstra's algorithm
inferred← citeshttps://doi.org/10.48550/arxiv.1809.09516openalex-snapshot
A dual ascent algorithm for asynchronous distributed optimization with unreliable directed communications
inferred← citeshttps://doi.org/10.48550/arxiv.1812.03773openalex-snapshot
Linear convergence of distributed Dykstra's algorithm for sets under an intersection property
inferred← citeshttps://doi.org/10.48550/arxiv.2103.07810openalex-snapshot
Categories of Brègman operations and epistemic (co)monads
inferred← citeshttps://doi.org/10.68381/jca06018openalex-snapshot
Dykstra's Algorithm as the Nonlinear Extension of Bregman's Optimization Method
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.