Approximating sparse Hessian matrices using large-scale linear least squares
From MaRDI portal
Publication:6582397
DOI10.1007/S11075-023-01681-ZzbMATH Open1544.65048MaRDI QIDQ6582397
J. A. Scott, Nicholas I. M. Gould, Jaroslav M. Fowkes
Publication date: 2 August 2024
Published in: Numerical Algorithms (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Solution of sparse linear least squares problems using Givens rotations
- On the behavior of the gradient norm in the steepest descent method
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- New parallel sparse direct solvers for multicore architectures
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Numerical solution of saddle point problems
- Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Solving Mixed Sparse-Dense Linear Least-Squares Problems by Preconditioned Iterative Methods
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Saddle-Point Problems and Their Iterative Solution
- Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- Design of a Multicore Sparse Cholesky Factorization Using DAGs
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Preconditioning
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
This page was built for publication: Approximating sparse Hessian matrices using large-scale linear least squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582397)