Talk on open problems at AMSI Optimise

Title: Open problems in convex optimisation
Time and Venue: 16:10pm, Monash Conference Centre
AMSI Optimise

Abstract: Solving an optimisation problem usually involves choosing an appropriate algorithm or designing a new one if none exists. This may be a difficult task as some problems are notoriously hard, for instance NP-hard problems such as the famous travelling salesman problem. However “P versus NP” is not the only challenge faced by the researchers in optimisation theory. There are numerous open questions whose resolution will lead to breakthroughs in our understanding of optimisation.

Continue reading "Talk on open problems at AMSI Optimise"