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
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
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
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
Scaling Disk-Resident Learned Indexes For Database Systems. This project aims to investigate new disk-resident learned indexing algorithms to store and process data in database systems by advancing the state-of-the-art in memory-resident learned modeling. This project expects to generate new knowledge in the area of digital storage technologies utilising novel and efficient techniques in learned indexing for big data. This should provide significant benefits to enable modern database systems to ....Scaling Disk-Resident Learned Indexes For Database Systems. This project aims to investigate new disk-resident learned indexing algorithms to store and process data in database systems by advancing the state-of-the-art in memory-resident learned modeling. This project expects to generate new knowledge in the area of digital storage technologies utilising novel and efficient techniques in learned indexing for big data. This should provide significant benefits to enable modern database systems to scale with the massive growth of data, improve the efficiency of data processing, improve the effectiveness of projects that utilise big data, and dramatically reduce energy costs in Australian data centres when storing and retrieving data from databases and lower their carbon footprints.Read moreRead less
Beyond Query: Exploratory Subgraph Discovery and Search System. Exploring co-working user groups in dynamic network data is a vital challenge in many applications, for example, in online education. This project aims to discover new relationships of users and compute their co-working performance in continuous time periods. The outcomes of the project are to design effective subgraph exploratory models, three novel types of subgraph search solutions, and devise a friendly exploratory subgraph sear ....Beyond Query: Exploratory Subgraph Discovery and Search System. Exploring co-working user groups in dynamic network data is a vital challenge in many applications, for example, in online education. This project aims to discover new relationships of users and compute their co-working performance in continuous time periods. The outcomes of the project are to design effective subgraph exploratory models, three novel types of subgraph search solutions, and devise a friendly exploratory subgraph search system for supporting the real-time network data analytics. The success of the project will make a significant contribution to the scientific foundation of graph data mining and its applications in data engineering domains, as well as benefiting co-working performance of people in Australian labor markets.Read moreRead less
Industrial Transformation Training Centres - Grant ID: IC200100009
Funder
Australian Research Council
Funding Amount
$4,861,236.00
Summary
ARC Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA). OPTIMA addresses industry’s urgent need for decision-making tools for global competitiveness: reducing lead times, and financial and environmental costs, while improving efficiency, quality, and agility. Despite strong expertise in academia, industry is yet to fully benefit from optimisation technology due to its high barrier to entry. Connecting industry partners with world-leading interdiscip ....ARC Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA). OPTIMA addresses industry’s urgent need for decision-making tools for global competitiveness: reducing lead times, and financial and environmental costs, while improving efficiency, quality, and agility. Despite strong expertise in academia, industry is yet to fully benefit from optimisation technology due to its high barrier to entry. Connecting industry partners with world-leading interdisciplinary researchers and talented students, OPTIMA will advance an industry-ready optimisation toolkit, while training a new generation of industry practitioners and over 120 young researchers, vanguarding a highly skilled workforce of change agents for transformation of the advanced manufacturing, energy resources, and critical infrastructure sectors.Read moreRead less
Discovery Early Career Researcher Award - Grant ID: DE200100063
Funder
Australian Research Council
Funding Amount
$394,398.00
Summary
Nonmonotone Algorithms in Operator Splitting, Optimisation and Data Science. This project aims to develop the mathematical foundations for the analysis and development of optimisation algorithms used in data science. Despite their now ubiquitous use, machine learning software packages routinely rely on a number of algorithms from mathematical optimisation which are not properly understood. By moving beyond the traditional realms of Fejér monotone algorithms, this project expects to develop the m ....Nonmonotone Algorithms in Operator Splitting, Optimisation and Data Science. This project aims to develop the mathematical foundations for the analysis and development of optimisation algorithms used in data science. Despite their now ubiquitous use, machine learning software packages routinely rely on a number of algorithms from mathematical optimisation which are not properly understood. By moving beyond the traditional realms of Fejér monotone algorithms, this project expects to develop the mathematical theory required to rigorously justify the use of such algorithms and thereby ensure the integrity of the decision tools they produce. This mathematical framework is also expected to produce new algorithms for optimisation which benefit consumers of data science such as the health-care and cybersecurity sectors.Read moreRead less