On the public citation graph
A factorization method for the solution of constrained linear least squares problems allowing subsequent data changes
0 signed · 34 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.1090/s0025-5718-1976-0431641-8openalex-snapshot
Reorthogonalization and stable algorithms for updating the Gram-Schmidt 𝑄𝑅 factorization
inferredcites →https://doi.org/10.1137/0708038openalex-snapshot
On the Numerical Solution of Constrained Least-Squares Problems
inferredcites →https://doi.org/10.1137/1.9781611971217openalex-snapshot
Solving Least Squares Problems
inferredcites →https://doi.org/10.6028/jres.073b.009openalex-snapshot
An evaluation of linear least squares computer programs
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-3-642-48417-9_24openalex-snapshot
Iterative Methods for Quadratic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-95406-1_20openalex-snapshot
Nonlinear Programming Methods with Linear Least Squares Subproblems
inferred← citeshttps://doi.org/10.1007/bf00934629openalex-snapshot
Numerical study of some feasible direction methods in mathematical programming
inferred← citeshttps://doi.org/10.1007/bf00935003openalex-snapshot
Numerical computation of the projection of a point onto a polyhedron
inferred← citeshttps://doi.org/10.1007/bf01390423openalex-snapshot
Error analysis of an algorithm for solving an underdetermined linear system
inferred← citeshttps://doi.org/10.1007/bf01395810openalex-snapshot
The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function
inferred← citeshttps://doi.org/10.1007/bf01395811openalex-snapshot
The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function
inferred← citeshttps://doi.org/10.1007/bf01403888openalex-snapshot
A direct method for sparse least squares problems with lower and upper bounds
inferred← citeshttps://doi.org/10.1007/bf01584232openalex-snapshot
An algorithm for linear least squares problems with equality and nonnegativity constraints
inferred← citeshttps://doi.org/10.1007/bf01937487openalex-snapshot
Solving the minimal least squares problem subject to bounds on the variables
inferred← citeshttps://doi.org/10.1007/bf02591962openalex-snapshot
A numerically stable dual method for solving strictly convex quadratic programs
inferred← citeshttps://doi.org/10.1007/bf03654958openalex-snapshot
Some Proposals Concerning the Diagonal Second Order Design of Geodetic Networks
inferred← citeshttps://doi.org/10.1007/s002110050065openalex-snapshot
A Cholesky dual method for proximal piecewise linear programming
inferred← citeshttps://doi.org/10.1007/s10543-022-00930-2openalex-snapshot
Solving large linear least squares problems with linear equality constraints
inferred← citeshttps://doi.org/10.1007/s11075-025-02192-9openalex-snapshot
Krylov iterative methods for linear least squares problems with linear equality constraints
inferred← citeshttps://doi.org/10.1007/s11081-017-9366-1openalex-snapshot
Best practices for comparing optimization algorithms
inferred← citeshttps://doi.org/10.1016/0165-1684(87)90017-xopenalex-snapshot
An incomplete factorization algorithm for adaptive filtering
inferred← citeshttps://doi.org/10.1016/0771-050x(79)90011-1openalex-snapshot
Bibliography on the evaluation of numerical software
inferred← citeshttps://doi.org/10.1016/b978-0-12-656460-0.50011-2openalex-snapshot
Linear Lp Regression with Linear Constraints
inferred← citeshttps://doi.org/10.1023/a:1008617207791openalex-snapshot
Computing 3SLS Solutions of Simultaneous Equation Models with a Possible Singular Variance–Convariance Matrix
inferred← citeshttps://doi.org/10.1080/02331938708843215openalex-snapshot
Existence, characterization and application of interpolating minimal polynomials
inferred← citeshttps://doi.org/10.1080/03610919308813095openalex-snapshot
A branch and bound algorithm for constrained least squares
inferred← citeshttps://doi.org/10.1109/cdc.1999.831287openalex-snapshot
Recursive least squares with linear constraints
inferred← citeshttps://doi.org/10.1137/0907055openalex-snapshot
Linear Least Squares with Bounds and Linear Constraints
inferred← citeshttps://doi.org/10.1145/356068.356075openalex-snapshot
Randomly Generated Test Problems for Positive Definite Quadratic Programming
inferred← citeshttps://doi.org/10.14201/gredos.143554openalex-snapshot
Valoración de la estabilidad y el rendimiento de modelos bayesianos en meta-análisis de pruebas diagnósticas, basada en estudios de simulación
inferred← citeshttps://doi.org/10.4310/cis.2007.v7.n3.a5openalex-snapshot
Recursive Least Squares with Linear Constraints
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.