back to search
You learn the fundamentals and methods of convex optimization: analysis of convex sets and functions, optimality conditions, duality, and algorithms such as Simplex, gradient/Newton methods, and interior-point methods. In the end you will be able to formulate problems as convex optimization tasks, derive optimality and duality conditions, and apply appropriate solution methods.
From the current semester, not binding.
No ratings for this module yet.
Only fill in the categories you can judge – for each one, either stars and text together or nothing at all.
Reviews are automatically checked before they are published.
Official page in TUMonline · Details are not binding.