Your browser does not support JavaScript, or its support is disabled. Some features may not be available.
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
Teaching methods:
full-time
Annotation -
--- Czech English
Last update: G_I (26.10.2001)
Some important classes of global optimization problems. Outer approximation
methods. Concavity cuts. Branch and bound method. Concave minimization. D.C.
programming.
Základní přístupy k řešení nekonvexních optimalizačních úloh.
Last update: RNDr. Pavel Zakouřil, Ph.D. (05.08.2002)
F.Forgo: Nonconvex Programming. Akademiai Kiado,Budapest 1988
R.Horst,H.Tuy: Global Optimization. Springer Verlag Berlin 1990
Syllabus -
--- Czech English
Last update: T_KAM (20.04.2009)
Some important classes of global optimization problems. Outer approximation
methods. Concavity cuts. Branch and bound method. Concave minimization. D.C.
programming.
Last update: doc. RNDr. Libuše Grygarová, DrSc. (06.04.2007)
Some important classes of global optimization problems. Outer approximation
methods. Concavity cuts. Branch and bound method. Concave minimization. D.C.
programming.
