Subject: Subject Sylbus: Computational Methods - 046197 (Current)

Computational Methods - 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.


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




Times and places of examinations 02/2020 2020/2021 Spring Semester
examination timedaydateSeason
 Friday09.07.2021א
 Sunday17.10.2021ב

Timetable to semester 02/2020 2020/2021 Spring Semester
RoomBuildingHourdayLecturerExercise
Lecture
no.Registering
Group
280בנ.מאייר08:30-10:30MondayDoctor Levy YehudaLecture1011
704Ullman17:30-18:30MondayMr. Dorfman RonExercise11
 
    Doctor Levy YehudaLecture6069
     Exercise69

Created in 21/04/2021 Time 23:45:31