An optimisation-based framework for non-classical Chebyshev approximation. This project aims to solve open mathematical problems in multivariate and piecewise polynomial approximations, two directions that correspond to fundamental obstacles to extending classical approximation results. Through an innovative combination of optimisation and algebraic technique, the project intends to develop foundations for new results in approximation theory, and new insights into other areas of mathematics, mos ....An optimisation-based framework for non-classical Chebyshev approximation. This project aims to solve open mathematical problems in multivariate and piecewise polynomial approximations, two directions that correspond to fundamental obstacles to extending classical approximation results. Through an innovative combination of optimisation and algebraic technique, the project intends to develop foundations for new results in approximation theory, and new insights into other areas of mathematics, most notably optimisation. The techniques and methods developed should also have significant benefits in the many disciplines where approximation problems appear, such as engineering, physics or data mining. The research outputs resulting from this project will be used in a wide range of fields to help implement programs, policies and improve decision making.Read moreRead less
Regularisation methods of inverse problems: theory and computation. This project aims to investigate regularisation methods for inverse problems which are ill-posed in the sense that their solutions depend discontinuously on the data. When only noisy data is available, regularisation methods define stable approximate solutions by replacing the original inverse problem with a family of well-posed neighbouring problems monitored by a so-called regularisation parameter. The project expects to devel ....Regularisation methods of inverse problems: theory and computation. This project aims to investigate regularisation methods for inverse problems which are ill-posed in the sense that their solutions depend discontinuously on the data. When only noisy data is available, regularisation methods define stable approximate solutions by replacing the original inverse problem with a family of well-posed neighbouring problems monitored by a so-called regularisation parameter. The project expects to develop purely data-driven rules to choose the regularisation parameter and show how they work in theory, and in practice. It will also develop convex framework, acceleration strategies as well as preconditioning and splitting ideas to design efficient regularisation solvers.Read moreRead less