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
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
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
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
Stability of Generalised Equations and Variational Systems. This project seeks to advance a new mathematical theory of variational analysis which may lead to applications in optimisation. The emphasis will be on extensions of regularity concepts appropriate for studying stability (the ‘radius of good behaviour’) of solutions to optimisation problems, particularly those of semi-infinite optimisation and programs with equilibrium constraints, when standard assumptions are not satisfied. The expect ....Stability of Generalised Equations and Variational Systems. This project seeks to advance a new mathematical theory of variational analysis which may lead to applications in optimisation. The emphasis will be on extensions of regularity concepts appropriate for studying stability (the ‘radius of good behaviour’) of solutions to optimisation problems, particularly those of semi-infinite optimisation and programs with equilibrium constraints, when standard assumptions are not satisfied. The expected outcomes may have an impact in enhancing the convergence of numerical methods and facilitating the post-optimal analysis of solutions. It may also generate new tools for increasing efficiencies and cost reductions in engineering, logistics, economics, financial systems, and environmental science.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