Skip to main content
Skip header

Methods of Optimization

Course aims

The student will be able to recognize basic classes of optimization problems and will understand conditions of their solvability and correct formulation. Effective algorithms, heuristics and software will be presented in an extent that is useful for solving engineering problems, so that the student will be able to apply their knowledge to the solution of practical problems.

Literature

M. S: Bazaraa, C. M. Shetty: Nonlinear programming, J. Wiley, New York 1979, ruský překlad Mir Moskva 1982.
J. Nocedal, S. Wright, Numerical Optimization, Springer, New York 2005.
R. Fletcher: Practical Methods of Optimization, John Wiley & sons, Chichester 1997.

Advised literature

D. P. Bertsekas, Nonlinear Programming, Athena Scientific, Belmont 1999.
Z. Dostal, Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities Springer, New York 2009.
I. Griva, S. G. Nash, A. Sofer, Linear and Nonlinear Optimization, Second Edition, SIAM , Philadelphia 2008.
D. T. Pham and D. Karaboga, Intelligent Optimization Techniques, Springer, London 2000.


Language of instruction Czech, English
Code 470-6503
Abbreviation MO
Course title Methods of Optimization
Coordinating department Department of Applied Mathematics
Course coordinator prof. RNDr. Zdeněk Dostál, DSc.