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
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