2015FS: 31063 Convex Optimization
This course presents the background theory of convex optimisation and focuses on their application to imaging.
Content: Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume problems. Optimality conditions, duality theory and applications. Interior-point methods. Primal-Dual method. Applications to computer vision, image and signal processing, statistics and machine learning, control engineering.
The coursework will consist of a project to be chosen among:
1. Superresolution
2. Inpainting
3. Demosaicing
Also, projects proposed by the students will be considered.