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
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
Switching Dynamics Approach for Distributed Global Optimisation . This project aims to create a breakthrough switching dynamics approach and new technology to speed up finding optimal solutions. It will develop a distributed switching dynamics based optimisation scheme for global optimisation problems in industrial big-data environments where timely decision making is required. It will result in a practical technology for industry optimisation problems such as economic energy dispatch in smart g ....Switching Dynamics Approach for Distributed Global Optimisation . This project aims to create a breakthrough switching dynamics approach and new technology to speed up finding optimal solutions. It will develop a distributed switching dynamics based optimisation scheme for global optimisation problems in industrial big-data environments where timely decision making is required. It will result in a practical technology for industry optimisation problems such as economic energy dispatch in smart grids and optimal charging and discharging tasks in a large network of electric vehicles, helping Australian power industry improve efficiency and security, as well as training the next generation scientists and engineers for Australia in this emerging field.Read moreRead less
Data-Driven Multistage Robust Optimization—the New Frontier in Optimization. Robust optimisation is a powerful technology for decision-making in uncertain environments. Yet, developing numerically certifiable optimisation principles and data-driven methods that can be readily implemented by common computer algorithms remains an elusive goal for multistage robust optimisation. But it is crucial for the practical use of multistage optimisation. This project aims to develop this novel mathematical ....Data-Driven Multistage Robust Optimization—the New Frontier in Optimization. Robust optimisation is a powerful technology for decision-making in uncertain environments. Yet, developing numerically certifiable optimisation principles and data-driven methods that can be readily implemented by common computer algorithms remains an elusive goal for multistage robust optimisation. But it is crucial for the practical use of multistage optimisation. This project aims to develop this novel mathematical theory and methods by extending the investigators' recent award winning advances, including the von Neumann-prizewinning Lasserre-hierarchy approach. Results will provide a foundation and technologies for making superior decisions in the pervasive presence of big data uncertainty, enhancing data-driven innovation in AustraliaRead moreRead less