On the public citation graph
On the augmented system approach to sparse least-squares problems
0 signed · 127 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/bf01386022openalex-snapshot
Jordan-Elimination und Ausgleichung nach kleinsten Quadraten
inferredcites →https://doi.org/10.1007/bf01386090openalex-snapshot
Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
inferredcites →https://doi.org/10.1007/bf01939321openalex-snapshot
Iterative refinement of linear least squares solutions I
inferredcites →https://doi.org/10.1007/bf01939974openalex-snapshot
Iterative refinement of linear least squares solutions II
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1016/b978-0-12-597050-1.50009-9openalex-snapshot
Numerical Techniques in Mathematical Programming
inferredcites →https://doi.org/10.1090/s0025-5718-1980-0572859-4openalex-snapshot
Iterative Refinement Implies Numerical Stability for Gaussian Elimination
inferredcites →https://doi.org/10.1137/0610013openalex-snapshot
Solving Sparse Linear Systems with Sparse Backward Error
inferredcites →https://doi.org/10.1137/0722051openalex-snapshot
On the Method of Weighting for Equality-Constrained Least-Squares Problems
inferredcites →https://doi.org/10.1137/1029112openalex-snapshot
A Survey of Condition Number Estimation for Triangular Matrices
inferredcites →https://doi.org/10.1145/322139.322148openalex-snapshot
Scaling for Numerical Stability in Gaussian Elimination
inferredcites →https://doi.org/10.1145/356044.356047openalex-snapshot
The Multifrontal Solution of Indefinite Sparse Symmetric Linear
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4330030610openalex-snapshot
LAPACK: A portable linear algebra library for high‐performance computers
inferred← citeshttps://doi.org/10.1002/nla.1823openalex-snapshot
On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products
inferred← citeshttps://doi.org/10.1002/nla.2189openalex-snapshot
On the optimal convergence factor of the accelerated parameterized inexact Uzawa method with three parameters for augmented systems
inferred← citeshttps://doi.org/10.1002/nla.610openalex-snapshot
Regularization and preconditioning of KKT systems arising in nonnegative least‐squares problems
inferred← citeshttps://doi.org/10.1002/nla.70036openalex-snapshot
Mixed Precision Iterative Refinement for Least Squares With Linear Equality Constraints and Generalized Least Squares Problems
inferred← citeshttps://doi.org/10.1002/nla.702openalex-snapshot
Condition numbers and perturbation analysis for the Tikhonov regularization of discrete ill-posed problems
inferred← citeshttps://doi.org/10.1007/11752578_62openalex-snapshot
Direct Solution of Linear Systems of Size 109 Arising in Optimization with Interior Point Methods
inferred← citeshttps://doi.org/10.1007/978-0-585-26778-4_6openalex-snapshot
Sparse Linear Least Squares Problems in Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_6openalex-snapshot
Implementation of Interior-Point Methods for Large Scale Linear Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-69984-0_21openalex-snapshot
A Note on the Sensitivity of Generic Approximate Sparse Pseudoinverse Matrix for Solving Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-21105-8_20openalex-snapshot
A Class of New Generalized AOR Method for Augmented Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-76717-3_13openalex-snapshot
Parallel Algorithms for General Sparse Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-76717-3_3openalex-snapshot
Algorithms for Linear Least Squares Problems
inferred← citeshttps://doi.org/10.1007/b100325openalex-snapshot
Interior Point Methods for Linear Optimization
inferred← citeshttps://doi.org/10.1007/bf00945713openalex-snapshot
Selection of fictitious independent variables for the solution of sparse linear equations
inferred← citeshttps://doi.org/10.1007/bf01585158openalex-snapshot
Solving symmetric indefinite systems in an interior-point method for linear programming
inferred← citeshttps://doi.org/10.1007/bf01739829openalex-snapshot
Solution of sparse rectangular systems using LSQR and CRAIG
inferred← citeshttps://doi.org/10.1007/bf01931284openalex-snapshot
Component-wise perturbation analysis and error bounds for linear least squares solutions
inferred← citeshttps://doi.org/10.1007/bf01933262openalex-snapshot
Iterative refinement enhances the stability ofQR factorization methods for solving linear equations
inferred← citeshttps://doi.org/10.1007/bf01935013openalex-snapshot
Solution of augmented linear systems using orthogonal factorizations
inferred← citeshttps://doi.org/10.1007/bf01935647openalex-snapshot
Corrected sequential linear programming for sparse minimax optimization
inferred← citeshttps://doi.org/10.1007/bf02680554openalex-snapshot
Warm start of the primal-dual method applied in the cutting-plane scheme
inferred← citeshttps://doi.org/10.1007/s002110050065openalex-snapshot
A Cholesky dual method for proximal piecewise linear programming
inferred← citeshttps://doi.org/10.1007/s10287-008-0090-3openalex-snapshot
Exploiting structure in parallel implementation of interior point methods for optimization
inferred← citeshttps://doi.org/10.1007/s10543-008-0160-5openalex-snapshot
Symmetric-triangular decomposition and its applications part II: Preconditioners for indefinite systems
inferred← citeshttps://doi.org/10.1007/s10543-009-0213-4openalex-snapshot
Using dual techniques to derive componentwise and mixed condition numbers for a linear function of a linear least squares solution
inferred← citeshttps://doi.org/10.1007/s11075-013-9735-6openalex-snapshot
Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
inferred← citeshttps://doi.org/10.1007/s11075-014-9937-6openalex-snapshot
On the minimum convergence factor of a class of GSOR-like methods for augmented systems
inferred← citeshttps://doi.org/10.1016/b978-0-12-656460-0.50008-2openalex-snapshot
Linear Lp Regression
inferred← citeshttps://doi.org/10.1016/j.amc.2006.05.094openalex-snapshot
Symmetric SOR method for augmented systems
inferred← citeshttps://doi.org/10.1016/j.amc.2010.03.051openalex-snapshot
A class of Uzawa-SOR methods for saddle point problems
inferred← citeshttps://doi.org/10.1016/j.amc.2014.11.047openalex-snapshot
Convergence of relaxation iterative methods for saddle point problem
inferred← citeshttps://doi.org/10.1016/j.amc.2017.01.051openalex-snapshot
Variants of the Uzawa method for three-order block saddle point problem
inferred← citeshttps://doi.org/10.1016/j.aml.2014.12.001openalex-snapshot
A generalized shift-splitting preconditioner for saddle point problems
inferred← citeshttps://doi.org/10.1016/j.cam.2007.07.001openalex-snapshot
On generalized symmetric SOR method for augmented systems
inferred← citeshttps://doi.org/10.1016/j.cam.2011.10.016openalex-snapshot
Convergence of a generalized MSSOR method for augmented systems
inferred← citeshttps://doi.org/10.1016/j.cam.2018.10.001openalex-snapshot
Generalized AOR method for solving a class of generalized saddle point problems
inferred← citeshttps://doi.org/10.1016/j.cam.2019.02.015openalex-snapshot
A class of new extended shift-splitting preconditioners for saddle point problems
inferred← citeshttps://doi.org/10.1016/j.camwa.2011.03.103openalex-snapshot
A modified symmetric successive overrelaxation method for augmented systems
inferred← citeshttps://doi.org/10.1016/j.camwa.2013.01.037openalex-snapshot
Variants of the Uzawa method for saddle point problem
inferred← citeshttps://doi.org/10.1016/j.camwa.2014.07.003openalex-snapshot
Semi-convergence analysis of GMSSOR methods for singular saddle point problems
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.09.017openalex-snapshot
Interior point methods 25 years later
inferred← citeshttps://doi.org/10.1016/j.heliyon.2024.e35694openalex-snapshot
Generalized and novel iterative scheme for best approximate solution of large and sparse augmented linear systems
inferred← citeshttps://doi.org/10.1016/s0024-3795(97)00334-0openalex-snapshot
Componentwise analysis of direct factorization of real symmetric and hermitian matrices
inferred← citeshttps://doi.org/10.1016/s0096-3003(99)00120-4openalex-snapshot
Perturbation bound of singular linear systems
inferred← citeshttps://doi.org/10.1016/s0377-2217(96)00400-6openalex-snapshot
The augmented system variant of IPMs in two-stage stochastic linear programming computation
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00074-xopenalex-snapshot
The role of the augmented system in interior point methods
inferred← citeshttps://doi.org/10.1017/s0962492900002300openalex-snapshot
Interior methods for constrained optimization
inferred← citeshttps://doi.org/10.1017/s0962492904000212openalex-snapshot
Numerical solution of saddle point problems
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1008680131271openalex-snapshot
Sparse Linear Least Squares Problems in Optimization
inferred← citeshttps://doi.org/10.1023/a:1019245101545openalex-snapshot
Building and Solving Large-Scale Stochastic Programs on an Affordable Distributed Computing System
inferred← citeshttps://doi.org/10.1023/a:1021904604693openalex-snapshot
Symmetric-Triangular Decomposition and its Applications Part I: Theorems and Algorithms
inferred← citeshttps://doi.org/10.1023/a:1021965717530openalex-snapshot
SOR-like Methods for Augmented Systems
inferred← citeshttps://doi.org/10.1023/a:1026452506999openalex-snapshot
Stabilization of Interior-Point Methods for Linear Programming
inferred← citeshttps://doi.org/10.1023/b:coap.0000026882.34332.1bopenalex-snapshot
Preconditioning Indefinite Systems in Interior Point Methods for Optimization
inferred← citeshttps://doi.org/10.1023/b:numa.0000021758.65113.f5openalex-snapshot
Conjugate Gradient Method for Rank Deficient Saddle Point Problems
inferred← citeshttps://doi.org/10.1080/00207160.2020.1849638openalex-snapshot
A class of modified GSS preconditioners for complex symmetric linear systems
inferred← citeshttps://doi.org/10.1080/02331939308843876openalex-snapshot
Implementing cholesky factorization for interior point methods of linear programming
inferred← citeshttps://doi.org/10.1080/03081087.2017.1337059openalex-snapshot
A condition analysis of the weighted linear least squares problem using dual norms
inferred← citeshttps://doi.org/10.1080/10236198.2016.1259314openalex-snapshot
Perturbation analysis of saddle-point problems
inferred← citeshttps://doi.org/10.1080/10556780701535910openalex-snapshot
Preconditioning indefinite systems in interior point methods for large scale linear optimisation
inferred← citeshttps://doi.org/10.1080/10556789908805754openalex-snapshot
Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
inferred← citeshttps://doi.org/10.1090/conm/112/1087110openalex-snapshot
Computing error bounds for regression problems
inferred← citeshttps://doi.org/10.1090/mcom/4168openalex-snapshot
On adaptive stochastic extended iterative methods for solving least squares
inferred← citeshttps://doi.org/10.1090/psapm/048/1314843openalex-snapshot
A survey of componentwise perturbation theory in numerical linear algebra
inferred← citeshttps://doi.org/10.1090/s0025-5718-06-01913-2openalex-snapshot
On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0001openalex-snapshot
Recent Developments in Dense Numerical Linear Algebra
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1108/ec-12-2025-1543openalex-snapshot
Some theoretical and computational results using newly developed generalized iterative scheme for optimal numerical solution of augmented linear systems
inferred← citeshttps://doi.org/10.1109/cacsd.1989.69824openalex-snapshot
LAPACK: a portable linear algebra library for supercomputers
inferred← citeshttps://doi.org/10.1109/iccis.2013.249openalex-snapshot
GMSSOR Methods for Solving Singular Augmented Systems
inferred← citeshttps://doi.org/10.1109/superc.1990.129995openalex-snapshot
LAPACK: A portable linear algebra library for high-performance computers
inferred← citeshttps://doi.org/10.1109/superc.1990.130066openalex-snapshot
Parallel algorithm research at CERFACS
inferred← citeshttps://doi.org/10.1137/050633354openalex-snapshot
On Numerical Issues of Interior Point Methods
inferred← citeshttps://doi.org/10.1137/0613003openalex-snapshot
The Componentwise Distance to the Nearest Singular Matrix
inferred← citeshttps://doi.org/10.1137/0613014openalex-snapshot
Backward Error and Condition of Structured Linear Systems
inferred← citeshttps://doi.org/10.1137/0613022openalex-snapshot
Preconditioners for Indefinite Systems Arising in Optimization
inferred← citeshttps://doi.org/10.1137/0613024openalex-snapshot
Sparse Matrices in MATLAB: Design and Implementation
inferred← citeshttps://doi.org/10.1137/0613079openalex-snapshot
Modifying the QR-Decomposition to Constrained and Weighted Linear Least Squares
inferred← citeshttps://doi.org/10.1137/0911047openalex-snapshot
Experience with a Matrix Norm Estimator
inferred← citeshttps://doi.org/10.1137/0913003openalex-snapshot
A Block Projection Method for Sparse Matrices
inferred← citeshttps://doi.org/10.1137/120902677openalex-snapshot
A Fast Semidirect Least Squares Algorithm for Hierarchically Block Separable Matrices
inferred← citeshttps://doi.org/10.1137/16m1065380openalex-snapshot
On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/18m1166407openalex-snapshot
A Novel Partitioning Method for Accelerating the Block Cimmino Algorithm
inferred← citeshttps://doi.org/10.1137/21m1416552openalex-snapshot
Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
inferred← citeshttps://doi.org/10.1137/21m1453475openalex-snapshot
Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
inferred← citeshttps://doi.org/10.1137/24m1664927openalex-snapshot
A Comparison of Mixed Precision Iterative Refinement Approaches for Least-Squares Problems
inferred← citeshttps://doi.org/10.1137/s1064827596297549openalex-snapshot
Tensor Methods for Large, Sparse Nonlinear Least Squares Problems
inferred← citeshttps://doi.org/10.1137/s1064827598345667openalex-snapshot
On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
inferred← citeshttps://doi.org/10.1145/174603.174408openalex-snapshot
Sparse QR factorization in MATLAB
inferred← citeshttps://doi.org/10.1155/2013/326169openalex-snapshot
Convergence of a Generalized USOR Iterative Method for Augmented Systems
inferred← citeshttps://doi.org/10.1177/16878132221111206openalex-snapshot
A modified variant of HSS preconditioner for generalized saddle point problems
inferred← citeshttps://doi.org/10.1177/16878132221119451openalex-snapshot
A new generalized shift-splitting method for nonsymmetric saddle point problems
inferred← citeshttps://doi.org/10.12988/ams.2016.511692openalex-snapshot
Fast one-parameter variant of preconditioned Uzawa method with a scaled preconditioner for saddle point problems
inferred← citeshttps://doi.org/10.12988/ams.2016.6269openalex-snapshot
Performance comparison of relaxation methods with singular and nonsingular preconditioners for singular saddle point problems
inferred← citeshttps://doi.org/10.14317/jami.2016.085openalex-snapshot
FAST ONE-PARAMETER RELAXATION METHOD WITH A SCALED PRECONDITIONER FOR SADDLE POINT PROBLEMS
inferred← citeshttps://doi.org/10.22103/jmmrc.2021.16445.1121openalex-snapshot
On the GTSOR-like Method for the Augmented systems
inferred← citeshttps://doi.org/10.2298/fil0901043zopenalex-snapshot
Mixed and component wise condition numbers for weighted Moore-Penrose inverse and weighted least squares problems
inferred← citeshttps://doi.org/10.2991/mmebc-16.2016.230openalex-snapshot
On the generalized MSSOR method for augmented systems
inferred← citeshttps://doi.org/10.3934/mbe.2019048openalex-snapshot
A parameterized shift-splitting preconditioner for saddle point problems
inferred← citeshttps://doi.org/10.4134/bkms.2015.52.5.1669openalex-snapshot
SEMI-CONVERGENCE OF THE PARAMETERIZED INEXACT UZAWA METHOD FOR SINGULAR SADDLE POINT PROBLEMS
inferred← citeshttps://doi.org/10.4134/jkms.j150230openalex-snapshot
ACCELERATION OF ONE-PARAMETER RELAXATION METHODS FOR SINGULAR SADDLE POINT PROBLEMS
inferred← citeshttps://doi.org/10.46939/j.sci.arts-21.2-a05openalex-snapshot
NEW MODIFIED SSOR METHOD FOR NUMERICAL SOLUTION OF LINEAR AUGMENTED SYSTEM
inferred← citeshttps://doi.org/10.47749/t/unicamp.2006.365011openalex-snapshot
Planejamento da expansão de sistemas de transmissão usando os modelos CC - CA e tecnicas de programação não-linear
inferred← citeshttps://doi.org/10.48550/arxiv.1708.07693openalex-snapshot
Parallel solution of large sparse linear least squares problems
inferred← citeshttps://doi.org/10.48550/arxiv.1805.11487openalex-snapshot
The augmented Block Cimmino algorithm revisited
inferred← citeshttps://doi.org/10.5555/110382.110584openalex-snapshot
Parallel algorithm research at CERFACS
inferred← citeshttps://doi.org/10.70675/a283919az0167z4cf1z9a2fz438b513bf749openalex-snapshot
Hybrid direct and interactive solvers for sparse indefinite and overdetermined systems on future exascale architectures
inferred← citeshttps://doi.org/10.7717/peerj-cs.3680openalex-snapshot
Improving parallel hybrid solvers through block low-rank compression and adaptive threshold selection
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.