Subject: Subject Sylbus: Computational Methods in Optimization - 046197

Computational Methods in Optimization - 046197
Credit
Points
3.0
 
Given In
Semester
b
 
  Lecture Exercise Laboratory Project or
Seminar
House
Work
Weekly
Hours
2 1     5

Determination of the grade according to progress during the semester and a final examination.


Prerequisites Introduction to Probability H 104034
or ( Differential and Integral Calculus 2T 104013
and Algebra 1/Extended 104016 )
 
Overlapping Courses Optimization Theory 104193
Introduction to Optimization 236330


-Convex Optimization Problem with and Without Constraints -First Order Optimization Methods -First Order Stochastic Optimization Methods and the Sgd Algorithm -Momentum Methods and Nesterov S Accelerated Methods -the Frank-Wolfe Method -Duality -Kkt Conditions -Newton S Method. After the Successful Completion of the Course:
1. The Students Will Be Familiar with Definitions and Properties of Optimization Problems, and Will Know to Read and Write Such Problems by Themselves._
2. the Students Will Be Familiar with Popular Optimization Methods, Their Advantages and Their Disadvantages.




System of hours to the semesters
Semester Previous Semester information 02/2021 2021/2022 Spring Semester

Created in 29/09/2022 Time 01:04:17