ARC Centre of Excellence for Mathematical and Statistical Frontiers of Big Data, Big Models, New Insights. In today's world, massive amounts of data in a variety of forms are collected daily from a multitude of sources. Many of the resulting data sets have the potential to make vital contributions to society, business and government, as well as impact on international developments, but are so large or complex that they are difficult to process and analyse using traditional tools. The aim of this ....ARC Centre of Excellence for Mathematical and Statistical Frontiers of Big Data, Big Models, New Insights. In today's world, massive amounts of data in a variety of forms are collected daily from a multitude of sources. Many of the resulting data sets have the potential to make vital contributions to society, business and government, as well as impact on international developments, but are so large or complex that they are difficult to process and analyse using traditional tools. The aim of this Centre is to create innovative mathematical and statistical models that can uncover the knowledge concealed within the size and complexity of these big data sets, with a focus on using the models to deliver insight into problems vital to the Centre's Collaborative Domains: Healthy People, Sustainable Environments and Prosperous Societies.Read moreRead less
Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming. Because of their rich modelling capabilities, integer programs are widely used in industry for decision making and planning. However their solution algorithms do not have the maturity of their cousins in convex optimisation, where the theory of strong duality is ubiquitous. Efficient methods for convex optimisation under uncertainty do not apply to the integer case, which is highly non-convex. Furthermore, i ....Decomposition and Duality: New Approaches to Integer and Stochastic Integer Programming. Because of their rich modelling capabilities, integer programs are widely used in industry for decision making and planning. However their solution algorithms do not have the maturity of their cousins in convex optimisation, where the theory of strong duality is ubiquitous. Efficient methods for convex optimisation under uncertainty do not apply to the integer case, which is highly non-convex. Furthermore, integer models usually assume the data is known with certainty, which is often not the case in the real world. This project will develop new theory and algorithms to enhance the analysis of integer models, including those that incorporating uncertainty, while also enabling the use of parallel computing paradigms. Read moreRead less
Mathematics and computing for integrated stockyard-centric management of mining supply chains. Blended mineral products, such as coal and iron ore, make a strong contribution to Australia's economy. Blending occurs in stockpiles, so to realise product value, stockyard and supply chain operational plans must align with blend targets. This project will provide new mathematical and computational planning tools to maximise this value.
Integrating Mobility on Demand in urban transport infrastructures. Australia’s major cities are substantially challenged for public transport services due to the dispersed and low population densities, and thus, roads are at or beyond their capacity. Smarter demand-responsive public transport services are therefore needed. This project studies the viability of such a service under a variety of scenarios.
Discovery Early Career Researcher Award - Grant ID: DE150100240
Funder
Australian Research Council
Funding Amount
$315,000.00
Summary
Geometry and Conditioning in Structured Conic Problems. Conic programming allows one to model and solve large industrial problems via modern optimisation methods, such as interior-point algorithms. These methods are efficient and reliable in solving a vast number of problems, however, they fail on a relatively small but significant set of ill-posed instances, thus affecting the overall reliability of the technique. The reason for such behaviour is profound and constitutes one of the major unsolv ....Geometry and Conditioning in Structured Conic Problems. Conic programming allows one to model and solve large industrial problems via modern optimisation methods, such as interior-point algorithms. These methods are efficient and reliable in solving a vast number of problems, however, they fail on a relatively small but significant set of ill-posed instances, thus affecting the overall reliability of the technique. The reason for such behaviour is profound and constitutes one of the major unsolved problems in real complexity: there is no known algorithm that solves conic problems with real data in polynomial time. The project aims to develop a deep understanding of the geometry of conic problems, aiming for the resolution of this fundamental problem in computational theory.Read moreRead less