Papers

• Worst-case evaluation complexity and optimality of second-order methods for nonconvex smooth optimization

  C Cartis; NIM Gould; PL Toint;

  Type: Preprint

  Published in: Proceedings of the International Congress of Mathematicians

• Preordering saddle-point systems for sparse LDLT factorization without pivoting

  S Lungten; WHA Schilders; JA Scott;

  Type: Preprint

  Published in: Numerical Linear Algebra with Applications

• QPLIB: a library of quadratic programming instances

  F Furini; E Traversi; P Belotti; A Frangioni; A Gleixner; NIM Gould; L Liberti; A Lodi; R Misener; H Mittelmann; NV Sahinidis; S Vigerske; A Wiegele;

  Type: Preprint

  Published in: Mathematical Programming Computation

• Solving mixed sparse-dense linear least squares by preconditioned iterative methods

  J Scott; M Tuma;

  Type: Preprint

  Published in: SIAM Journal on Scientific Computing

• Optimality of orders one to three and beyond : characterization and evaluation complexity in constrained nonconvex optimization

  C Cartis; NIM Gould; PL Toint;

  Type: Preprint

  Published in: Journal of Complexity

• Experiments with sparse Cholesky using a parametrized task graph implementation

  IS Duff; F Lopez;

  Type: Report

  Published in: Rutherford Appleton Laboratory Technical Reports (- 2022)

• Solving mixed sparse-dense linear least-squares problems by preconditioned iterative methods

  J Scott; M Tuma;

  Type: Journal Article

  Published in: SIAM Journal on Scientific Computing

• Numerically Aware Orderings for Sparse Symmetric Indefinite Linear Systems

  J Hogg; J Scott; S Thorne;

  Type: Journal Article

  Published in: ACM Transactions on Mathematical Software

• Improving the stability and robustness of incomplete symmetric indefinite factorization preconditioners

  J Scott; M Tuma;

  Type: Journal Article

  Published in: Numerical Linear Algebra with Applications

• Fast synchronization-free algorithms for parallel sparse triangular solves with multiple right-hand sides

  W Liu; A Li; JD Hogg; IS Duff; B Vinter;

  Type: Journal Article

  Published in: Concurrency and Computation: Practice and Experience

• Worst-case evaluation complexity of regularization methods for smooth unconstrained optimization using Hölder continuous gradients

  C Cartis; N Gould; P Toint;

  Type: Journal Article

  Published in: Optimization Methods and Software

• Sparse direct solution on parallel computers

  I Duff; F Lopez; S Nakov;

  Type: Report

  Published in: Rutherford Appleton Laboratory Technical Reports (- 2022)

• On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems

  J Scott;

  Type: Journal Article

  Published in: SIAM Journal on Scientific Computing

• The Hellerman-Rarick algorithm

  IS Duff; AM Erisman; JK Reid;

  Type: Report

  Published in: Rutherford Appleton Laboratory Technical Reports (- 2022)

• A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows

  J Scott; M Tuma;

  Type: Preprint

  Published in: Numerical Algorithms

• The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems

  N Gould; J Scott;

  Type: Journal Article

  Published in: ACM Transactions on Mathematical Software

• Improved second-order evaluation complexity for unconstrained nonlinear optimization using high-order regularized models

  C Cartis; NIM Gould; PL Toint;

  Type: Preprint

  Published in: SIAM Journal on Optimization

• Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems

  NIM Gould; T Rees; JA Scott;

  Type: Preprint

  Published in: Computational Optimization and Applications

• A higher order method for solving nonlinear least-squares problems

  NIM Gould; T Rees; JA Scott;

  Type: Preprint

  Published in: SIAM Journal on Scientific Computing

• Second-Order Optimality and Beyond: Characterization and Evaluation Complexity in Convexly Constrained Nonlinear Optimization

  C Cartis; NIM Gould; PL Toint;

  Type: Journal Article

  Published in: Foundations of Computational Mathematics