Stability of Generalised Equations and Variational Systems. This project seeks to advance a new mathematical theory of variational analysis which may lead to applications in optimisation. The emphasis will be on extensions of regularity concepts appropriate for studying stability (the ‘radius of good behaviour’) of solutions to optimisation problems, particularly those of semi-infinite optimisation and programs with equilibrium constraints, when standard assumptions are not satisfied. The expect ....Stability of Generalised Equations and Variational Systems. This project seeks to advance a new mathematical theory of variational analysis which may lead to applications in optimisation. The emphasis will be on extensions of regularity concepts appropriate for studying stability (the ‘radius of good behaviour’) of solutions to optimisation problems, particularly those of semi-infinite optimisation and programs with equilibrium constraints, when standard assumptions are not satisfied. The expected outcomes may have an impact in enhancing the convergence of numerical methods and facilitating the post-optimal analysis of solutions. It may also generate new tools for increasing efficiencies and cost reductions in engineering, logistics, economics, financial systems, and environmental science.Read moreRead less
Structured barrier and penalty functions in infinite dimensional optimisation and analysis. Very large scale tightly-constrained optimisation problems are ubiquitous and include water management, traffic flow, and imaging at telescopes and hospitals. Massively parallel computers can solve such problems and provide physically realisable solution only if subtle design issues are mastered. Resolving such issues is the goal of this project.
Geometry in projection methods and fixed-point theory. This project aims to resolve mathematical challenges arising from problems with specific structure typical for key modern applications, such as big data optimisation, chemical engineering and medical imaging. We focus on developing new mathematical tools for the analysis of projection methods and accompanying fixed point theory, specifically targeting the refinement of the geometric intuition for algorithm design techniques to inform the imp ....Geometry in projection methods and fixed-point theory. This project aims to resolve mathematical challenges arising from problems with specific structure typical for key modern applications, such as big data optimisation, chemical engineering and medical imaging. We focus on developing new mathematical tools for the analysis of projection methods and accompanying fixed point theory, specifically targeting the refinement of the geometric intuition for algorithm design techniques to inform the implementation of optimal methods for huge-scale optimisation problems.Read moreRead less
Relaxed reflection methods for feasibility and matrix completion problems. The project proposes to further develop the non-linear convergence theory, and to provide problem-specific implementations. Many applied and pure problems require solution of a large set of linear or nonlinear equations (or inequalities). Highly effective, parallelisable methods are based on iterated projection or reflection algorithms which aggregate information about individual equations. The theory is well developed in ....Relaxed reflection methods for feasibility and matrix completion problems. The project proposes to further develop the non-linear convergence theory, and to provide problem-specific implementations. Many applied and pure problems require solution of a large set of linear or nonlinear equations (or inequalities). Highly effective, parallelisable methods are based on iterated projection or reflection algorithms which aggregate information about individual equations. The theory is well developed in the linear case, but does not explain many important applications for which they are often highly successful (eg optical aberration correction, protein reconstruction, tomography, compressed sensing). The project also plans to provide heuristics to help explain why an algorithm performs well on one class of applications but fails on another.Read moreRead less