On the public citation graph

Convergence of the cyclical relaxation method for linear inequalities

https://doi.org/10.1007/bf02591886
0 signed · 44 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.1007/bf01386209openalex-snapshot
On certain iterative methods for solving linear systems
inferredcites →https://doi.org/10.1007/bf01396307openalex-snapshot
Strong underrelaxation in Kaczmarz's method for inconsistent systems
inferredcites →https://doi.org/10.1007/bf01580425openalex-snapshot
A relaxation method for reconstructing objects from noisy X-rays
inferredcites →https://doi.org/10.1007/bf01581028openalex-snapshot
On the non-polynomiality of the relaxation method for systems of linear inequalities
inferredcites →https://doi.org/10.1007/bf01585003openalex-snapshot
An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
inferredcites →https://doi.org/10.1007/bfb0120784openalex-snapshot
On solving linear complementarity problems as linear programs
inferredcites →https://doi.org/10.1016/0041-5553(80)90061-0openalex-snapshot
Polynomial algorithms in linear programming
inferredcites →https://doi.org/10.1287/moor.5.3.388openalex-snapshot
The Relaxation Method for Solving Systems of Linear Inequalities
inferredcites →https://doi.org/10.4153/cjm-1954-037-2openalex-snapshot
The Relaxation Method for Linear Inequalities
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/nla.2233openalex-snapshot
Tight upper bounds for the convergence of the randomized extended Kaczmarz and Gauss–Seidel algorithms
inferred← citeshttps://doi.org/10.1007/978-3-030-86653-2_2openalex-snapshot
An Algorithm for Polytope Overlapping Detection
inferred← citeshttps://doi.org/10.1007/978-3-319-99673-8_16openalex-snapshot
Parallel Method of Pseudoprojection for Linear Inequalities
inferred← citeshttps://doi.org/10.1007/bf01580851openalex-snapshot
On the convergence properties of Hildreth's quadratic programming algorithm
inferred← citeshttps://doi.org/10.1007/bf01582569openalex-snapshot
A row-action method for convex programming
inferred← citeshttps://doi.org/10.1007/bf02193462openalex-snapshot
Primal-dual row-action method for convex programming
inferred← citeshttps://doi.org/10.1007/bf02193464openalex-snapshot
Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
inferred← citeshttps://doi.org/10.1007/s11075-017-0425-7openalex-snapshot
Convergence rates for Kaczmarz-type algorithms
inferred← citeshttps://doi.org/10.1016/0022-247x(85)90127-1openalex-snapshot
An automatic relaxation method for solving interval linear inequalities
inferred← citeshttps://doi.org/10.1016/0024-3795(89)90375-3openalex-snapshot
Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
inferred← citeshttps://doi.org/10.1016/0024-3795(93)00089-iopenalex-snapshot
Block-iterative surrogate projection methods for convex feasibility problems
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90017-yopenalex-snapshot
A class of methods for solving large convex systems
inferred← citeshttps://doi.org/10.1016/0168-9274(87)90028-6openalex-snapshot
On some optimization techniques in image reconstruction from projections
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90174-0openalex-snapshot
About geometrical convergence of general iterative methods applied to nonunique solvable convex problems, Part II
inferred← citeshttps://doi.org/10.1016/0377-0427(94)90390-5openalex-snapshot
About geometrical convergence of general iterative methods applied to nonunique solvable convex problems, Part I
inferred← citeshttps://doi.org/10.1016/j.cam.2015.04.014openalex-snapshot
Hildreth’s algorithm with applications to soft constraints for user interface layout
inferred← citeshttps://doi.org/10.1016/s1076-5670(08)70157-5openalex-snapshot
The Convex Feasibility Problem in Image Recovery
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.1016/s1570-579x(01)80017-3openalex-snapshot
Superlinear Rate of Convergence and Optimal Acceleration Schemes in the Solution of Convex Inequality Problems
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/00207169808804732openalex-snapshot
Asymptotically optimal row-action methods for generalized least squares problems
inferred← citeshttps://doi.org/10.1109/5.214546openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/83.563316openalex-snapshot
Convex set theoretic image recovery by extrapolated iterations of parallel subgradient projections
inferred← citeshttps://doi.org/10.1109/icassp.1991.151014openalex-snapshot
The foundations of set theoretic estimation
inferred← citeshttps://doi.org/10.1109/isbi.2008.4541074openalex-snapshot
A fast parallel method for medical imaging problems including linear inequality constraints
inferred← citeshttps://doi.org/10.1109/lsp.2015.2412253openalex-snapshot
On the Exponential Convergence of the Kaczmarz Algorithm
inferred← citeshttps://doi.org/10.1137/0801025openalex-snapshot
On Dual Convergence and the Rate of Primal Convergence of Bregman’s Convex Programming Method
inferred← citeshttps://doi.org/10.1137/0802021openalex-snapshot
On the Convergence of the Products of Firmly Nonexpansive Mappings
inferred← citeshttps://doi.org/10.1137/s0036144593251710openalex-snapshot
On Projection Algorithms for Solving Convex Feasibility Problems
inferred← citeshttps://doi.org/10.1287/moor.18.2.317openalex-snapshot
Convergence Properties of Iterative Methods for Symmetric Positive Semidefinite Linear Complementarity Problems
inferred← citeshttps://doi.org/10.1287/opre.2023.0425openalex-snapshot
Exponential Concentration in Stochastic Approximation
inferred← citeshttps://doi.org/10.15517/rmta.v11i1.236openalex-snapshot
Algoritmos Numéricos para el Problema de Restauración de Imágenes usando el Método de las Proyecciones Alternantes
inferred← citeshttps://doi.org/10.21236/ada458804openalex-snapshot
Successive Projection under a Quasi-Cyclic Order
inferred← citeshttps://doi.org/10.48550/arxiv.1409.2902openalex-snapshot
The Hildreth's Algorithm with Applications to Soft Constraints for User Interface Layout
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.