Course description:
This course provides an introduction to convex optimization, covering the mathematical fundamentals of convex analysis and duality theory, algorithms, and modelling of practical applications.
Academic honesty/integrity statement:
Students are expected to maintain the highest standards of academic integrity. All work submitted must be original and properly cited. Plagiarism, cheating, or any form of academic dishonesty will result in immediate consequences as outlined in the university's academic integrity policy.
