SubjectsSubjects(version: 845)
Course, academic year 2018/2019
   Login via CAS
Numerical Optimization Methods - NMNV534
Title in English: Numerické metody optimalizace
Guaranteed by: Department of Numerical Mathematics (32-KNM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2014
Semester: summer
E-Credits: 5
Hours per week, examination: summer s.:2/2 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: taught
Language: Czech, English
Teaching methods: full-time
Guarantor: doc. RNDr. Petr Tichý, Ph.D.
Class: M Mgr. MMIB
M Mgr. MMIB > Povinně volitelné
M Mgr. NVM
M Mgr. NVM > Povinně volitelné
Classification: Mathematics > Numerical Analysis
Incompatibility : NNUM121
Interchangeability : NNUM121
Annotation -
Last update: T_KNM (07.04.2015)
Optimization and minimization techniques. Optimization method, global convergence, speed of convergence. Minimization of a functional, descent techniques, nonlinear conjugate gradient method, Quasi-Newton methods, trust-region methods. Least-squares problems, the Gauss-Newton method. Theory of constrained optimization, Lagrange multipliers, convex optimization, penalty and barrier methods, projection and dual methods. The course is suitable for students focused on industrial mathematics and numerical analysis.
Course completion requirements -
Last update: doc. RNDr. Petr Tichý, Ph.D. (16.02.2018)

It is not necessary to obtain a course-credit before passing the exam.

The course-credit will be granted for the attendance.

The nature of these requirements does not allow a possibility of some additional attempts to obtain the course-credit.

Literature - Czech
Last update: doc. RNDr. Petr Tichý, Ph.D. (07.04.2015)

R. Fletcher, Practical Methods of Optimization, 2nd edition Wiley 1987, (republished 2000).

D. G. Luenberger and Y. Ye, Linear and Nonlinear Programming, Third edition. Springer, New York, MA, 2008.

J. Nocedal and S. Wright, Numerical Optimization, Second edition, Springer Verlag 2006.

J. E. Dennis, Jr. and Robert B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, SIAM 1996, originally published in 1983.

Requirements to the exam -
Last update: doc. RNDr. Petr Tichý, Ph.D. (16.02.2018)

The exam is oral. Requirements for the oral exam correspond to the syllabus of the course, presented at the lectures.

Syllabus -
Last update: doc. RNDr. Petr Tichý, Ph.D. (07.04.2015)

Theory of unconstrained optimization (necessary and sufficient conditions, the role of convexity, classification of convergence), minimization in a given direction (Golden section search, curve fitting, Newton), inexact line search (Goldstein, Armijo, and Wolfe conditions), basic descent methods (the method of steepest descent and the Newton method), conjugate direction methods (the nonlinear conjugate gradient method), Quasi-Newton methods (the quasi-Newton condition, rank-one update, DFP, BFGS, the Broyden family), trust-region methods, least-squares problems (the Gauss-Newton and the Levenberg-Marquart method). Theory of constrained optimization (Lagrange multipliers, necessary and sufficient conditions), penalty and barrier methods, linear programming and the Simplex method.

Entry requirements -
Last update: doc. RNDr. Petr Tichý, Ph.D. (02.05.2018)

Fundamentals of multivariable calculus and numerical linear algebra. Basic knowledge of the Matlab programming language.

Charles University | Information system of Charles University |