New Theory and Algorithms for Nonsmooth Optimisation with Application to Integer Programming. Mathematical optimisation plays a key role in a wide variety of applications in business, industry, engineering and science. For example, airlines cannot fly and radiation treatment for cancer cannot be delivered without solving (a series of) optimisation problems. Some classes of optimisation problem are very well solved, with clear mathematical foundations, efficient algorithms, and reliable software ....New Theory and Algorithms for Nonsmooth Optimisation with Application to Integer Programming. Mathematical optimisation plays a key role in a wide variety of applications in business, industry, engineering and science. For example, airlines cannot fly and radiation treatment for cancer cannot be delivered without solving (a series of) optimisation problems. Some classes of optimisation problem are very well solved, with clear mathematical foundations, efficient algorithms, and reliable software implementations. Both nonsmooth and integer optimisation problems have a good mathematical basis, but there are "gaps"; existing methods cannot always solve real industrial problems. This project will deliver better methods, built on better theory, and so will yield better solutions for important applications.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.
Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming. Because of their rich modelling capabilities, integer programs are widely used in industry for decision making and planning. However their solution algorithms do not have the maturity of their cousins in convex optimisation, where the theory of strong duality is ubiquitous. Efficient methods for convex optimisation under uncertainty do not apply to the integer case, which is highly non-convex. Furthermore, i ....Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming. Because of their rich modelling capabilities, integer programs are widely used in industry for decision making and planning. However their solution algorithms do not have the maturity of their cousins in convex optimisation, where the theory of strong duality is ubiquitous. Efficient methods for convex optimisation under uncertainty do not apply to the integer case, which is highly non-convex. Furthermore, integer models usually assume the data is known with certainty, which is often not the case in the real world. This project will develop new theory and algorithms to enhance the analysis of integer models, including those that incorporating uncertainty, while also enabling the use of parallel computing paradigms. Read moreRead less