Jonathan Pearson

Jonathan Pearson

Auto-generated profile, based on publicly available information

Jonathan Pearson

School of Mathematics and Maxwell Institute for Mathematical Sciences, The University of Edinburgh, Edinburgh, UK

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
7 January 2021 in Numerical Linear Algebra with Applications
Verified
Journal Article
Open access
PDF file
LBLuca Bergamaschi
Luca Bergamaschi
JGJacek Gondzio
Jacek Gondzio
ÁCÁngeles Martinez Calomardo
Ángeles Martinez Calomardo
JPJohn W. Pearson
John W. Pearson
SPSpyridon Pougkakiotis
Spyridon Pougkakiotis
In this article, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers, which in turn results in a primal‐dual regularized interior point method. Application of this method gives rise to a sequence of increasingly ill‐conditioned linear systems which cannot always be solved by factorization methods, due to memory and CPU time restrictions. We propose a novel preconditioning strategy which is based on a suitable sparsification of the normal equations matrix in the linear case, and also constitutes the foundation of a block‐diagonal preconditioner to accelerate MINRES for linear systems arising from the solution of general quadratic programming problems. Numerical results for a range of test problems demonstrate the robustness of the proposed preconditioning strategy, together with its ability to solve linear systems of very large dimension.

5 August 2023 in IMA Journal of Numerical Analysis
Verified
Journal Article
Open access
PDF file
JPJohn W Pearson
John W Pearson
APAndreas Potschka
Andreas Potschka
We consider symmetric positive definite preconditioners for multiple saddle-point systems of block tridiagonal form, which can be applied within the Minres algorithm. We describe such a preconditioner for which the preconditioned matrix has only two distinct eigenvalues, $1$ and $-1$, when the preconditioner is applied exactly. We discuss the relative merits of such an approach compared to a more widely studied block diagonal preconditioner, specify the computational work associated with applying the new preconditioner inexactly, and survey a number of theoretical results for the block diagonal case. Numerical results validate our theoretical findings.

7 August 2018 in Advances in Computational Mathematics
Verified
Journal Article
Closed access
PDF file
RHRoland Herzog
Roland Herzog
JPJohn W. Pearson
John W. Pearson
MSMartin Stoll
Martin Stoll

14 November 2022 in Computational Optimization and Applications
Verified
Journal Article
Open access
PDF file
JGJacek Gondzio
Jacek Gondzio
SPSpyridon Pougkakiotis
Spyridon Pougkakiotis
JPJohn W. Pearson
John W. Pearson
In this paper we present general-purpose preconditioners for regularized augmented systems, and their corresponding normal equations, arising from optimization problems. We discuss positive definite preconditioners, suitable for CG and MINRES. We consider “sparsifications" which avoid situations in which eigenvalues of the preconditioned matrix may become complex. Special attention is given to systems arising from the application of regularized interior point methods to linear or nonlinear convex programming problems.

21 May 2019 in Numerical Algorithms
Verified
Journal Article
Closed access
PDF file
JLJun Liu
Jun Liu
JPJohn W. Pearson
John W. Pearson

9 December 2024 in Computational Optimization and Applications
Verified
Journal Article
Closed access
PDF file
LBLuca Bergamaschi
Luca Bergamaschi
ÁCÁngeles Martinez Calomardo
Ángeles Martinez Calomardo
JPJohn W. Pearson
John W. Pearson
APAndreas Potschka
Andreas Potschka