The course description: Optimization techniques is a comprehensive course that covers both unconstrained and constrained optimization. It begins with the basics of functions and convex sets, followed by unconstrained optimization algorithms including steepest descent, Newton method, and conjugate gradient. The second part of the course focuses on constrained optimization, including KKT conditions and special problems such as linear programming and recursive programming. Students will need prior experience with high-level programming languages such as C/C++, Java, or C#. The course aims to provide a strong understanding of optimization techniques and their practical applications. Students will learn to apply optimization algorithms to real-world problems.
Credit hours: 3
Prerequisites: MATH329
Objectives of the course :
• Identify the differences between limited and unrestricted improvement problems.
• Acquire the ability to solve improvement problems for both constrained and non-constrained situations.
• Study the standard forms of the main improvement problems such as the unrestricted case, the linearly constrained case, the nonlinear constrained case, and the quadratic case.
• Properly defining and applying the optimality conditions such as the necessary first rank conditions (FONC), the necessary second rank conditions (SONC), the sufficient second rank conditions (SOSC), and the sufficient first rank conditions (FOSC) in restricted and unrestricted cases.
• Applying mathematical procedures to solve the problems of continuously improving without repetition using the steepest descent method, the Newton method, and the paired gradient method.
Course outputs :
1.1: Understanding the concepts of unrestricted and restricted improvement, and applying these concepts to real-world problems.
2.1: Conveying and explaining the mathematical formulation of standard improvement problems expressed in verbal terms.
2.2: Formulate specific problems in the non-constrained and constrained improvement problems.
2.3: Analysis of computational complexity and convergence properties of various optimization algorithms.
2.4: Applying optimization algorithms using high-level programming languages such as C/C++, Java, or C#.
This website uses special cookies to ensure ease of use, improve your browsing experience, and clarify the terms and policies related to About user privacy. By continuing to browse this website, you acknowledge that you accept the use of cookies and the terms of the Privacy Policy