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: 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
Discovery Early Career Researcher Award - Grant ID: DE240100674
Funder
Australian Research Council
Funding Amount
$370,237.00
Summary
New Frontiers in Large-Scale Polynomial Optimisation. Polynomial optimisation is ubiquitous in many areas of engineering and applied mathematics. The mathematical methods and algorithms used for polynomial problems of large size are not sufficiently developed, limiting their applicability for real-world problems. This project aims to develop a mathematical foundation and computational methods for large-scale polynomial optimisation. By using an innovative combination of a novel theory of algebra ....New Frontiers in Large-Scale Polynomial Optimisation. Polynomial optimisation is ubiquitous in many areas of engineering and applied mathematics. The mathematical methods and algorithms used for polynomial problems of large size are not sufficiently developed, limiting their applicability for real-world problems. This project aims to develop a mathematical foundation and computational methods for large-scale polynomial optimisation. By using an innovative combination of a novel theory of algebraic geometry and convex optimisation, this project expects to generate new knowledge and tools for solving these problems. Anticipated outcomes include a new generation of large-scale optimisation technologies, providing significant benefit to Australia's industries and international research standing.
Read moreRead less