Modern Methods in Nonconvex Optimisation - NOPT020

• Title: Moderní metody nekonvexní optimalizace
• Guaranteed by: Department of Applied Mathematics (32-KAM)
• Faculty: Faculty of Mathematics and Physics
• Actual: from 2017
• Semester: winter
• E-Credits: 3
• Hours per week, examination: winter s.:2/0, Ex [HT]
• Capacity: unlimited
• Min. number of students: unlimited
• 4EU+: no
• Virtual mobility / capacity: no
• State of the course: cancelled
• Language: Czech
• Teaching methods: full-time
• Guarantor: doc. RNDr. Libuše Grygarová, DrSc.
• Class: Informatika Mgr. - volitelný
• Classification: Informatics > Optimalization
• Pre-requisite : NOPT016, NOPT018

Annotation

English

Some important classes of global optimization problems. Outer approximation methods. Concavity cuts. Branch and bound method. Concave minimization. D.C. programming.

Last update: G_I (26.10.2001)

Czech

Základní přístupy k řešení nekonvexních optimalizačních úloh.

Last update: ()

Literature

F.Forgo: Nonconvex Programming. Akademiai Kiado,Budapest 1988

R.Horst,H.Tuy: Global Optimization. Springer Verlag Berlin 1990

Last update: Zakouřil Pavel, RNDr., Ph.D. (05.08.2002)

Syllabus

English

Some important classes of global optimization problems. Outer approximation

methods. Concavity cuts. Branch and bound method. Concave minimization. D.C.

programming.

Last update: T_KAM (20.04.2009)

Czech

Some important classes of global optimization problems. Outer approximation

methods. Concavity cuts. Branch and bound method. Concave minimization. D.C.

programming.

Last update: Grygarová Libuše, doc. RNDr., DrSc. (06.04.2007)