Convex optimization problems arising in, e.g., data analysis and machine learning, and efficient algorithms for solving them are studied. Convex duality theory, interior point algorithms and gradient based approaches are among techniques covered in the course. Kurssikirja: Stephen Boyd, Lieven Vandenberghe: Convex Optimization, Cambridge University Press, 2004.