Bushfire analytics: optimisation of fuel reduction. Bushfires are an integral part of the Australian ecosystem. However, their severity has been worsening rapidly over the past decade. This project aims to develop a principled and scalable methodology for optimising fuel treatment planning to reduce the potential for severe bushfires. This project expects to generate new knowledge in bushfire fuel management using a groundbreaking combination of mathematical modelling techniques and state-of-the ....Bushfire analytics: optimisation of fuel reduction. Bushfires are an integral part of the Australian ecosystem. However, their severity has been worsening rapidly over the past decade. This project aims to develop a principled and scalable methodology for optimising fuel treatment planning to reduce the potential for severe bushfires. This project expects to generate new knowledge in bushfire fuel management using a groundbreaking combination of mathematical modelling techniques and state-of-the-art optimisation methods. The expected outcomes should provide significant benefits to our nation's ability to respond and adapt to the impacts of environmental change on biological systems and urban and rural communities.Read moreRead less
Data-Driven Multistage Robust Optimization—the New Frontier in Optimization. Robust optimisation is a powerful technology for decision-making in uncertain environments. Yet, developing numerically certifiable optimisation principles and data-driven methods that can be readily implemented by common computer algorithms remains an elusive goal for multistage robust optimisation. But it is crucial for the practical use of multistage optimisation. This project aims to develop this novel mathematical ....Data-Driven Multistage Robust Optimization—the New Frontier in Optimization. Robust optimisation is a powerful technology for decision-making in uncertain environments. Yet, developing numerically certifiable optimisation principles and data-driven methods that can be readily implemented by common computer algorithms remains an elusive goal for multistage robust optimisation. But it is crucial for the practical use of multistage optimisation. This project aims to develop this novel mathematical theory and methods by extending the investigators' recent award winning advances, including the von Neumann-prizewinning Lasserre-hierarchy approach. Results will provide a foundation and technologies for making superior decisions in the pervasive presence of big data uncertainty, enhancing data-driven innovation in AustraliaRead moreRead less
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
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
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
New mathematics for multi-extremal optimization and diffusion tensor imaging. This project aims to establish numerically certifiable mathematical theory and methods for semi-algebraic optimisation problems. Numerically certifiable optimisation principles and techniques are vital for the practical use of optimisation technologies because they can be readily implemented by common computer models and algorithms. Yet no such methodologies exist for multi-extremal, semi-algebraic optimisation problem ....New mathematics for multi-extremal optimization and diffusion tensor imaging. This project aims to establish numerically certifiable mathematical theory and methods for semi-algebraic optimisation problems. Numerically certifiable optimisation principles and techniques are vital for the practical use of optimisation technologies because they can be readily implemented by common computer models and algorithms. Yet no such methodologies exist for multi-extremal, semi-algebraic optimisation problems which are common in modern science and medicine. The expected outcomes of this project include enhanced optimisation methods for diffusion tensor imaging, an emerging technology in brain sciences.Read moreRead less
Innovations in sparse optimisation: big data nonsmooth optimisation. This project aims to produce innovative optimisation methods capable of solving a wide range of practical problems that are currently too complex to be solved. Optimisation involving huge data sets is ubiquitous. Sparse optimisation has emerged as a challenging frontier of modern optimisation because it effectively computes an optimal solution with desired low complexity structure so that a resulting solution can be efficiently ....Innovations in sparse optimisation: big data nonsmooth optimisation. This project aims to produce innovative optimisation methods capable of solving a wide range of practical problems that are currently too complex to be solved. Optimisation involving huge data sets is ubiquitous. Sparse optimisation has emerged as a challenging frontier of modern optimisation because it effectively computes an optimal solution with desired low complexity structure so that a resulting solution can be efficiently stored, implemented and utilised, and is robust to the data inexactness. This project aims at developing innovative mathematical techniques and efficient numerical schemes for solving sparse optimisation problems. The intended outcomes will have significant impact on many areas of science, medicine and engineering, where sparse optimisation is used, including cancer radiotherapy optimal planning.Read moreRead less