Approximating sparse Hessian matrices using large-scale linear least squares
From MaRDI portal
(Redirected from Publication:6582397)
Recommendations
- New basic Hessian approximations for large-scale nonlinear least-squares optimization
- scientific article; zbMATH DE number 1101645
- A matrix algebra approach to approximate Hessians
- Approximating Hessians in unconstrained optimization arising from discretized problems
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods
Cites work
- scientific article; zbMATH DE number 1101645 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Computational Study of Using Black-box QR Solvers for Large-scale Sparse-dense Linear Least Squares Problems
- A General Updating Algorithm for Constrained Linear Least Squares Problems
- A Robust Algebraic Domain Decomposition Preconditioner for Sparse Normal Equations
- A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
- An Optimal Positive Definite Update for Sparse Hessian Matrices
- Design of a multicore sparse Cholesky factorization using DAGs
- 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
- New parallel sparse direct solvers for multicore architectures
- Numerical solution of saddle point problems
- On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- On the behavior of the gradient norm in the steepest descent method
- Preconditioning
- Saddle-point problems and their iterative solution
- Solution of sparse linear least squares problems using Givens rotations
- Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods
- Some Numerical Results Using a Sparse Matrix Updating Formula in Unconstrained Optimization
- Sparse Stretching for Solving Sparse-Dense Linear Least-Squares Problems
- Strengths and Limitations of Stretching for Least-squares Problems with Some Dense Rows
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems
Cited in
(2)
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)
