HSL_MA97

swMATH12664MaRDI QIDQ24590

No author found.

Related Items (21)

A Unified Efficient Implementation of Trust-region Type Algorithms for Unconstrained Optimization ⋮ 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 ⋮ Pivoting strategies for tough sparse indefinite systems ⋮ Compressed Threshold Pivoting for Sparse Symmetric Indefinite Systems ⋮ Chebyshev acceleration of iterative refinement ⋮ On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems ⋮ Level-set topology optimization with many linear buckling constraints using an efficient and robust eigensolver ⋮ Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners ⋮ A Fast Solver for anH₁Regularized PDE-Constrained Optimization Problem ⋮ HSL_MI28 ⋮ New parallel sparse direct solvers for multicore architectures ⋮ Wilkinson's inertia‐revealing factorization and its application to sparse matrices ⋮ Structured regularization for barrier NLP solvers ⋮ 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 ⋮ 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

This page was built for software: HSL_MA97