Computational Methods  046197





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 FrankWolfe 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.
הערות


מתרגל ובודק תרגילים: דורפמן רון

Times and places of examinations
02/2020
2020/2021 Spring Semester
examination time  day  date  Season 

 Friday  09.07.2021  א 
 Sunday  17.10.2021  ב 
Timetable to semester 02/2020
2020/2021 Spring Semester
Room  Building  Hour  day  Lecturer  Exercise Lecture  no.  Registering Group 

280  בנ.מאייר  08:3010:30  Monday  Doctor Levy Yehuda  Lecture  10  11 
704  Ullman  17:3018:30  Monday  Mr. Dorfman Ron  Exercise  11 

    Doctor Levy Yehuda  Lecture  60  69 
     Exercise  69 
Created in 21/04/2021 Time 23:45:31