Discovery Early Career Researcher Award - Grant ID: DE240100042
Funder
Australian Research Council
Funding Amount
$339,237.00
Summary
Hybrid optimisation for coordinating autonomous trucks and drones. This project aims to build analytics for controlling a fleet of autonomous trucks and drones working in tandem to deliver retail goods and disaster relief. This project expects to develop new mathematical and artificial intelligence algorithms for routing and scheduling the vehicles and for directing the multi-modal transfer of goods between vehicles in real-time as traffic conditions change. Expected outcomes of this project inc ....Hybrid optimisation for coordinating autonomous trucks and drones. This project aims to build analytics for controlling a fleet of autonomous trucks and drones working in tandem to deliver retail goods and disaster relief. This project expects to develop new mathematical and artificial intelligence algorithms for routing and scheduling the vehicles and for directing the multi-modal transfer of goods between vehicles in real-time as traffic conditions change. Expected outcomes of this project include new theories and technologies that enable a central computer to remotely control the autonomous fleet for maximum efficiency. Benefits in transport and logistics include improved freight productivity through reducing costs and delivery times.Read moreRead less
Distributed Optimisation without Central Coordination. This project will develop the mathematical foundations for discovery and analysis of iterative methods for optimisation problems in distributed computing systems. Most methods in distributed optimisation were not designed for distributed computing, rather they were adapted for purpose post-hoc. By building on recent advances in monotone operator splitting, this project expects to develop a mathematical theory for decentralised optimisation a ....Distributed Optimisation without Central Coordination. This project will develop the mathematical foundations for discovery and analysis of iterative methods for optimisation problems in distributed computing systems. Most methods in distributed optimisation were not designed for distributed computing, rather they were adapted for purpose post-hoc. By building on recent advances in monotone operator splitting, this project expects to develop a mathematical theory for decentralised optimisation algorithms specially designed for distributed systems. The framework is expected to produce a suite of algorithms, each customised to exploit a specific network configuration. The project will provide significant benefits in distributed machine learning applications such as federated learning.Read moreRead less
Real-time scheduling of trains to control peak electricity demand. This project aims to develop new scheduling and control methods that will enable railways to reduce their demand for electricity during peak demand periods, without undue disruption to the timetable.
These new methods and systems will integrate with—and expand the capabilities of—an Australian train control system that is used by railways around the world. This will enable better management of electricity within a region and be ....Real-time scheduling of trains to control peak electricity demand. This project aims to develop new scheduling and control methods that will enable railways to reduce their demand for electricity during peak demand periods, without undue disruption to the timetable.
These new methods and systems will integrate with—and expand the capabilities of—an Australian train control system that is used by railways around the world. This will enable better management of electricity within a region and better use of renewable energy sources, with significant cost savings for railways and the wider community.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE210101056
Funder
Australian Research Council
Funding Amount
$395,775.00
Summary
Realising the potential of hyperbolic programming. This project aims to develop and analyse new mathematical and algorithmic methods for polynomial optimisation and decision problems. In doing so it expects to generate knowledge and tools in mathematical optimisation that build on recent developments in the theory of hyperbolic polynomials. Expected outcomes include more scalable and/or reliable methods for polynomial optimisation and safety verification of dynamical systems, and theory explain ....Realising the potential of hyperbolic programming. This project aims to develop and analyse new mathematical and algorithmic methods for polynomial optimisation and decision problems. In doing so it expects to generate knowledge and tools in mathematical optimisation that build on recent developments in the theory of hyperbolic polynomials. Expected outcomes include more scalable and/or reliable methods for polynomial optimisation and safety verification of dynamical systems, and theory explaining the power and limitations of these methods when compared with existing approaches. Possible benefits include safer and more reliable complex engineered systems, such as the power grid or interacting autonomous vehicles, verified by methods built on those developed in the project.Read 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
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
Discovery Early Career Researcher Award - Grant ID: DE240100006
Funder
Australian Research Council
Funding Amount
$444,847.00
Summary
Robust Derivative-Free Algorithms for Complex Optimisation Problems. Mathematical optimisation gives a systematic way for optimal decision-making. This project aims to develop new mathematical tools for complex optimisation problems where limited problem information is available. It will generate new foundational theories for alternative optimisation tools, introducing substantial new capability and rigour to the discipline. The project will create significant new mathematical optimisation techn ....Robust Derivative-Free Algorithms for Complex Optimisation Problems. Mathematical optimisation gives a systematic way for optimal decision-making. This project aims to develop new mathematical tools for complex optimisation problems where limited problem information is available. It will generate new foundational theories for alternative optimisation tools, introducing substantial new capability and rigour to the discipline. The project will create significant new mathematical optimisation techniques and create world-leading and publicly available software. These new techniques and software may ultimately be able to solve some of the most complex optimisation problems in research and industry, such as improving long-term climate predictions and designing 3D-printed medical implants.Read moreRead less
Stochastic majorization--minimization algorithms for data science. The changing nature of acquisition and storage data has made the process of drawing inference infeasible with traditional statistical and machine learning methods. Modern data are often acquired in real time, in an incremental nature, and are often available in too large a volume to process on conventional machinery. The project proposes to study the family of stochastic majorisation-minimisation algorithms for computation of inf ....Stochastic majorization--minimization algorithms for data science. The changing nature of acquisition and storage data has made the process of drawing inference infeasible with traditional statistical and machine learning methods. Modern data are often acquired in real time, in an incremental nature, and are often available in too large a volume to process on conventional machinery. The project proposes to study the family of stochastic majorisation-minimisation algorithms for computation of inferential quantities in an incremental manner. The proposed stochastic algorithms encompass and extend upon a wide variety of current algorithmic frameworks for fitting statistical and machine learning models, and can be used to produce feasible and practical algorithms for complex models, both current and future.
Read moreRead less
Large scale nonsmooth, nonconvex optimisation. This project aims to develop, analyse, test and apply (sub) gradient-based methods for solving large scale nonsmooth, nonconvex optimisation problems. Large scale problems with complex nonconvex objective and/or constraint functions are among the most difficult in optimisation. This project will generate new knowledge in numerical optimisation and machine learning. The use of structures and sparsity of large scale problems will lead to the developme ....Large scale nonsmooth, nonconvex optimisation. This project aims to develop, analyse, test and apply (sub) gradient-based methods for solving large scale nonsmooth, nonconvex optimisation problems. Large scale problems with complex nonconvex objective and/or constraint functions are among the most difficult in optimisation. This project will generate new knowledge in numerical optimisation and machine learning. The use of structures and sparsity of large scale problems will lead to the development of better models, and more accurate and robust methods. The expected outcomes of the project are ready-to-implement and apply numerical methods for solving large-scale, nonsmooth, nonconvex optimisation problems, as well as problems in machine learning and regression analysis.Read moreRead less