HSL_MA97

swMATH12664MaRDI QIDQ24590FDOQ24590

Author name not available (Why is that?)

Cited In (21)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
• Chebyshev acceleration of iterative refinement
• A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization
• New parallel sparse direct solvers for multicore architectures
• Wilkinson's inertia‐revealing factorization and its application to sparse matrices
• Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver
• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows
• Sparse direct solution on parallel computers
• On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
• Compressed threshold pivoting for sparse symmetric indefinite systems
• Pivoting strategies for tough sparse indefinite systems
• HSL_MI28
• A Fast Solver for anH₁Regularized PDE-Constrained Optimization Problem
• Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners
• A sparse symmetric indefinite direct solver for GPU architectures
• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
• Methods for convex and general quadratic programming
• On Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
• A dual gradient-projection method for large-scale strictly convex quadratic problems
• A New Sparse $LDL^T$ Solver Using A Posteriori Threshold Pivoting
• Structured regularization for barrier NLP solvers

This page was built for software: HSL_MA97