Karabakh University Courses
In this section
List of all courses
[RIM 211] Convex Analysis
Instruction Language
Azerbaijani
Course Type
Elective - Block 1
Course Description
This course explores the properties of convex sets and convex functions, providing the mathematical foundation for optimization theory. The curriculum focuses on core concepts such as convex hulls, supporting hyperplanes, and the separation theorem. Students study subgradients, conjugate functions, and the Fenchel duality, which are essential for solving non-differentiable optimization problems. The course emphasizes the global optimality conditions in convex programming and the convergence analysis of descent methods. By the end of the semester, students will be capable of identifying and formulating convex optimization problems in fields like control systems, signal processing, and economics, ensuring they can develop efficient algorithms for large-scale engineering and data-driven challenges.
We use cookies in the delivery of our services. To learn about the cookies we use and information about your preferences and opt-out choices, please click here. By using our platform you agree to our use of cookies.
Decline
Accept
