Constrained and Stable Solutions of Nonlinear and Semismooth Equations. In this project, comprehensive models for designing safe power system parameters will be proposed, efficient algorthms for solving these models will be constructed. The new models and algorithms in this project will provide efficient tools to prevent catastrophic events in power systems, which is related with national security. This project will also strengthen collaboration of Australian applied
mathematians with inter ....Constrained and Stable Solutions of Nonlinear and Semismooth Equations. In this project, comprehensive models for designing safe power system parameters will be proposed, efficient algorthms for solving these models will be constructed. The new models and algorithms in this project will provide efficient tools to prevent catastrophic events in power systems, which is related with national security. This project will also strengthen collaboration of Australian applied
mathematians with international researchers and engineering scientists. This is important for the advance of science and technology in
Australia.Read moreRead less
Structured barrier and penalty functions in infinite dimensional optimisation and analysis. Very large scale tightly-constrained optimisation problems are ubiquitous and include water management, traffic flow, and imaging at telescopes and hospitals. Massively parallel computers can solve such problems and provide physically realisable solution only if subtle design issues are mastered. Resolving such issues is the goal of this project.
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
Optimising experimental design for robust product development: a case study for high-efficiency energy generation. This project tackles key mathematical challenges to provide a powerful new methodology and tool for optimal product design, making smarter use of limited information, minimising costly trials, shortening the product cycle, and boosting the competitiveness of both the Australian manufacturing and alternative energy production industries.
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
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: 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