On the public citation graph
Gauss-seidel method for least-distance problems
0 signed · 48 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/bf00939948openalex-snapshot
On the convergence of the coordinate descent method for convex differentiable minimization
inferredcites →https://doi.org/10.1007/bf01580381openalex-snapshot
Finding the nearest point in A polytope
inferredcites →https://doi.org/10.1007/bf01580588openalex-snapshot
A nonlinear equation for linear programming
inferredcites →https://doi.org/10.1007/bf01585748openalex-snapshot
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
inferredcites →https://doi.org/10.1007/bf01891408openalex-snapshot
Constrained best approximation in Hilbert space
inferredcites →https://doi.org/10.1007/bf01937487openalex-snapshot
Solving the minimal least squares problem subject to bounds on the variables
inferredcites →https://doi.org/10.1007/bf02591992openalex-snapshot
Convex quadratic programming with one constraint and bounded variables
inferredcites →https://doi.org/10.1007/bfb0120064openalex-snapshot
An interior-point algorithm for large-scale quadratic problems with box constraints
inferredcites →https://doi.org/10.1007/bfb0120929openalex-snapshot
Some continuity properties of polyhedral multifunctions
inferredcites →https://doi.org/10.1007/bfb0121249openalex-snapshot
Algorithm for a least-distance programming problem
inferredcites →https://doi.org/10.1016/0024-3795(92)90049-gopenalex-snapshot
Global error bounds for monotone affine variational inequality problems
inferredcites →https://doi.org/10.1016/0098-1354(83)80004-0openalex-snapshot
Methods for quadratic programming: A survey
inferredcites →https://doi.org/10.1016/0167-6377(92)90080-mopenalex-snapshot
On a global error bound for a class of monotone affine variational inequality problems
inferredcites →https://doi.org/10.1137/0312003openalex-snapshot
Finding the Point of a Polyhedron Closest to the Origin
inferredcites →https://doi.org/10.1137/0325023openalex-snapshot
Iterative Methods for Large Convex Quadratic Programs: A Survey
inferredcites →https://doi.org/10.1137/0330025openalex-snapshot
On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
inferredcites →https://doi.org/10.1137/0801009openalex-snapshot
Convergence of Iterates of an Inexact Matrix Splitting Algorithm for the Symmetric Monotone Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/0803008openalex-snapshot
Remarks on Convergence of the Matrix Splitting Algorithm for the Symmetric Linear Complementarity Problem
inferredcites →https://doi.org/10.1137/1.9780898719468openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
inferredcites →https://doi.org/10.2307/2004942openalex-snapshot
Iterative Solution of Nonlinear Equations in Several Variables
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.2139/ssrn.4780950openalex-extracted
A Cluster Chaotic Optimization for Solving Power Loss and Voltage Profile Problems in Electrical Distribution Networks
inferred← citeshttps://doi.org/10.1006/jath.1996.3082openalex-snapshot
A Dual Approach to Constrained Interpolationfrom a Convex Subset of Hilbert Space
inferred← citeshttps://doi.org/10.1007/978-1-4419-0236-8_2openalex-snapshot
Strategies for Multidimensional Data Visualization
inferred← citeshttps://doi.org/10.1007/978-1-4757-6388-1_12openalex-snapshot
Regularized Newton Methods for Minimization of Convex Quadratic Splines with Singular Hessians
inferred← citeshttps://doi.org/10.1007/978-3-031-78440-8_31openalex-snapshot
Optimization of Radial Distribution Networks Through an Improved African Vulture Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-0348-8871-4_10openalex-snapshot
Unconstrained Minimization of Quadratic Splines and Applications
inferred← citeshttps://doi.org/10.1007/bf01585760openalex-snapshot
A note on the strong polynomiality of convex quadratic 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/bf02592329openalex-snapshot
A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
inferred← citeshttps://doi.org/10.1007/s11227-022-04471-xopenalex-snapshot
Parallel design and implementation of Jacobi iterative algorithm based on ternary optical computer
inferred← citeshttps://doi.org/10.1016/0898-1221(95)00104-2openalex-snapshot
Error estimates and Lipschitz constants for best approximation in continuous function spaces
inferred← citeshttps://doi.org/10.1016/j.ejor.2004.09.011openalex-snapshot
Heuristic approach for minimizing the projection error in the integrated mapping
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.05.030openalex-snapshot
Optimal decisions in combining the SOM with nonlinear projection methods
inferred← citeshttps://doi.org/10.1016/j.jmaa.2008.12.048openalex-snapshot
Regularized gap function as penalty term for constrained minimization problems
inferred← citeshttps://doi.org/10.1016/j.knosys.2025.113145openalex-snapshot
A cluster chaotic optimization for solving power loss and voltage profiles problems on electrical distribution networks
inferred← citeshttps://doi.org/10.1023/a:1022651331550openalex-snapshot
Piecewise-Linear Pathways to the Optimal Solution Set in Linear Programming
inferred← citeshttps://doi.org/10.1023/a:1024029423064openalex-snapshot
An Implementation of the QSPLINE Method for Solving Convex Quadratic Programming Problems With Simple Bound Constraints
inferred← citeshttps://doi.org/10.1093/imanum/19.1.19openalex-snapshot
l1 solution of linear inequalities
inferred← citeshttps://doi.org/10.1109/icosec51865.2021.9591706openalex-snapshot
An Overview of Applications of Gaussian Numerical Methods
inferred← citeshttps://doi.org/10.1137/0803022openalex-snapshot
A Newton Method for Convex Regression, Data Smoothing, and Quadratic Programming with Bounded Constraints
inferred← citeshttps://doi.org/10.1137/s0363012993243022openalex-snapshot
Error Bounds for Piecewise Convex Quadratic Programs and Applications
inferred← citeshttps://doi.org/10.1137/s1052623493246045openalex-snapshot
A New Algorithm for Solving Strictly Convex Quadratic Programs
inferred← citeshttps://doi.org/10.1137/s1052623495287927openalex-snapshot
Abadie's Constraint Qualification, Metric Regularity, and Error Bounds for Differentiable Convex Inequalities
inferred← citeshttps://doi.org/10.1137/s1052623495293160openalex-snapshot
The Linear l 1 Estimator and the Huber M-Estimator
inferred← citeshttps://doi.org/10.1137/s1052623498337273openalex-snapshot
Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
inferred← citeshttps://doi.org/10.1201/9781584889793.ch16openalex-snapshot
Solution of Linear Inequalities
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.