Riadenie procesov – (full-time, attendance method), 1. semester
Level of study:
3.
Prerequisites for registration:
none
Assesment methods:
The course is evaluated as follows: 30% work during the semester, 70% written project. Evaluation scale follows the study rules at STU (passed / failed).
Learning outcomes of the course unit:
The student has knowledge of algorithms and the developing of procedures for solving optimization tasks using numerical methods. The student is able to numerically solve linear, quadratic and selected types of nonlinear optimization problems using available software, while he is able to create his own algorithms for solving optimization tasks.
Course contents:
Floating-point arithmetics, linear and quadratic optimization problems, active set method, interior point method, barrier functions for solving constrained optimization problems, nonlinear optimization problems
Recommended or required reading:
Basic:
BOYD, Stephen; VANDENBERGHE, Lieven. Convex Optimization. Cambridge: Cambridge Press, 2004. 716 p. ISBN 978-0521-83378-3.
Recommended:
Beck, Amir, Introduction to Nonlinear Optimization, Society for Industrial and Applied Mathematics, 2014.