Numerical Optimization Methods 2 - NMNV544
|
|
|
||
Theory of constrained optimization and fundamentals of algorithms for nonlinear constrained optimization.
The course deals with numerical optimization methods for solving problems of linear, quadratic, and sequential quadratic programming. Students will test the algorithms practically during the exercise.
Last update: Kučera Václav, doc. RNDr., Ph.D. (05.12.2018)
|
|
||
J. Nocedal, S. Wright, Numerical Optimization, 2nd edition, Springer, Berlin, 2006.
W. Sun, Y-X. Yuan, Optimization Theory and Methods: Nonlinear Programming, Springer, New York, 2006.
R. Fletcher, Practical Methods of Optimization, 2nd edition, John Wiley & Sons, New York, 2000. Last update: Kučera Václav, doc. RNDr., Ph.D. (15.01.2019)
|
|
||
Constrained optimization theory (Lagrange multipliers, necessary and sufficient conditions), linear programming and the simplex method, basics of algorithms for constrained optimization, quadratic programming, penalty methods and extended Lagrangian methods, sequential quadratic programming, interior point methods. Last update: Tichý Petr, doc. RNDr., Ph.D. (03.02.2022)
|