On the augmented system approach to sparse least-squares problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3604265 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3363343 (Why is no real title available?)
- A Survey of Condition Number Estimation for Triangular Matrices
- A new polynomial-time algorithm for linear programming
- Compatibility of approximate solution of linear equations with given error bounds for coefficients and right-hand sides
- Condition Estimates
- Iterative Refinement Implies Numerical Stability for Gaussian Elimination
- Iterative refinement of linear least squares solutions I
- Jordan-Elimination und Ausgleichung nach kleinsten Quadraten
- On the Method of Weighting for Equality-Constrained Least-Squares Problems
- Scaling for Numerical Stability in Gaussian Elimination
- Solving Sparse Linear Systems with Sparse Backward Error
- Sparse matrix test problems
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
Cited in
(51)- Enhancing Block Cimmino for Sparse Linear Systems with Dense Columns via Schur Complement
- On generalized symmetric SOR method for augmented systems
- The role of the augmented system in interior point methods
- Convergence of relaxation iterative methods for saddle point problem
- Semi-convergence analysis of GMSSOR methods for singular saddle point problems
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Iterative refinement enhances the stability of \(QR\) factorization methods for solving linear equations
- A class of modified GSS preconditioners for complex symmetric linear systems
- A survey of direct methods for sparse linear systems
- Symmetric SOR method for augmented systems
- Imposing symmetry in augmented linear systems.
- Implementing cholesky factorization for interior point methods of linear programming
- Symmetric-triangular decomposition and its applications. II: Preconditioners for indefinite systems
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- Convergence of a generalized MSSOR method for augmented systems
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Perturbation analysis of saddle-point problems
- The augmented system variant of IPMs in two-stage stochastic linear programming computation
- Solution of sparse rectangular systems using LSQR and Craig
- On mixed and componentwise condition numbers for Moore–Penrose inverse and linear least squares problems
- On the minimum convergence factor of a class of GSOR-like methods for augmented systems
- A parameterized shift-splitting preconditioner for saddle point problems
- Improved componentwise verified error bounds for least squares problems and underdetermined linear systems
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- Variants of the Uzawa method for three-order block saddle point problem
- scientific article; zbMATH DE number 554733 (Why is no real title available?)
- An augmented LSQR method
- Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy
- Exploiting structure in parallel implementation of interior point methods for optimization
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Condition numbers and perturbation analysis for the Tikhonov regularization of discrete ill-posed problems.
- Component-wise perturbation analysis and error bounds for linear least squares solutions
- Corrected sequential linear programming for sparse minimax optimization
- scientific article; zbMATH DE number 5815888 (Why is no real title available?)
- Using dual techniques to derive componentwise and mixed condition numbers for a linear function of a linear least squares solution
- On condition numbers for Moore-Penrose inverse and linear least squares problem involving Kronecker products
- Selection of fictitious independent variables for the solution of sparse linear equations
- Componentwise analysis of direct factorization of real symmetric and Hermitian matrices
- Generalized AOR method for solving a class of generalized saddle point problems
- The solution of large-scale least-squares problems on supercomputers
- Solution of augmented linear systems using orthogonal factorizations
- A generalized shift-splitting preconditioner for saddle point problems
- Warm start of the primal-dual method applied in the cutting-plane scheme
- A condition analysis of the weighted linear least squares problem using dual norms
- A class of new extended shift-splitting preconditioners for saddle point problems
- A modified symmetric successive overrelaxation method for augmented systems
- A novel partitioning method for accelerating the block Cimmino algorithm
- Perturbation bound of singular linear systems
- Interior point methods 25 years later
- A class of Uzawa-SOR methods for saddle point problems
- On the GTSOR-like Method for the Augmented systems
This page was built for publication: On the augmented system approach to sparse least-squares problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124275)
