470-8742/05 – Methods of Optimization (MONT)

Gurantor departmentDepartment of Applied MathematicsCredits4
Subject guarantordoc. Ing. Petr Beremlijski, Ph.D.Subject version guarantorprof. RNDr. Zdeněk Dostál, DSc.
Study levelundergraduate or graduateRequirementChoice-compulsory
Year2Semesterwinter
Study languageEnglish
Year of introduction2016/2017Year of cancellation2020/2021
Intended for the facultiesUSPIntended for study typesFollow-up Master
Instruction secured by
LoginNameTuitorTeacher giving lectures
BER95 doc. Ing. Petr Beremlijski, Ph.D.
DOS35 prof. RNDr. Zdeněk Dostál, DSc.
Extent of instruction for forms of study
Form of studyWay of compl.Extent
Full-time Credit and Examination 2+2
Part-time Credit and Examination 10+10

Subject aims expressed by acquired skills and competences

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.

Teaching methods

Lectures
Tutorials

Summary

Optimization methods are basic tools for improving design and technology. The students will learn about basic optimization problems, conditions of their solvability and correct formulation. Effective algorithms, heuristics and software will be presented in an extent that is useful for the soluving engineering problems.

Compulsory literature:

J. Nocedal and S. J. Wright, Numerical Optimization, Springer, 2006. R. Fletcher: Practical Methods of Optimization, John Wiley & Sons, Chichester 1997.

Recommended literature:

D. T. Pham and D. Karaboga, Intelligent Optimization Techniques, Springer, London 2000. Z. Dostal, Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities Springer, New York 2009.

Way of continuous check of knowledge in the course of semester

Verification of study: Written exam on unconstrained optimization (45 minutes, max 15 marks). Written exam on constrained optimization (45 minutes, max 15 marks). Conditions for credit: At least 15 marks on progress assessment.

E-learning

Other requirements

No additional requirements are imposed on a student.

Prerequisities

Subject has no prerequisities.

Co-requisities

Subject has no co-requisities.

Subject syllabus:

Lectures: An introduction to the calculus of variations. Linear spaces, funkcionls and their differentials (Fréchet, Gateaux). Euler equation and the solution of the classical problems of variational calculus. Unconstrained minimization. One-dimensional minimization of unimodular functions. Conditions of minimum, the Newton method and its modification. Gradient methods, method of conjugate gradients. Constrained minimization. Karush-Kuhn-Tucker conditions of optimality. Penalization and barrier methods for constrained minimization. Feasible direction method (SLP) and active set strategy for bound constrained problems. Duality in convex programming. Saddle points, Uzawa algorithm and augmented Lagrangians. Linear programming, simplex method. Non-smooth optimization, subgradients and optimality conditions. Global optimization, genetic and evolutionary algorithms, simulated annealing, tabu search. Software. Exercises: Introduction to the MATLAB programming. Implementation of the golden section and Fibonacci series methods. Implemenation of the Newton-like methods. Implementation of the gradient based method. Implementation of the conjugate gradient method. Implementation of the penalty methody for equality constrained minimization.

Conditions for subject completion

Full-time form (validity from: 2016/2017 Winter semester, validity until: 2020/2021 Summer semester)
Task nameType of taskMax. number of points
(act. for subtasks)
Min. number of pointsMax. počet pokusů
Credit and Examination Credit and Examination 100 (100) 51
        Credit Credit 30  10
        Examination Examination 70 (70) 21 3
                Písemná zkouška Written examination 50  1 3
                Ústní zkouška Oral examination 20  0
Mandatory attendence participation:

Show history

Conditions for subject completion and attendance at the exercises within ISP:

Show history

Occurrence in study plans

Academic yearProgrammeBranch/spec.Spec.ZaměřeníFormStudy language Tut. centreYearWSType of duty
2018/2019 (N2658) Computational Sciences (2612T078) Computational Sciences P English Ostrava 2 Choice-compulsory study plan
2017/2018 (N2658) Computational Sciences (2612T078) Computational Sciences P English Ostrava 2 Choice-compulsory study plan
2016/2017 (N2658) Computational Sciences (2612T078) Computational Sciences P English Ostrava 2 Choice-compulsory study plan

Occurrence in special blocks

Block nameAcademic yearForm of studyStudy language YearWSType of blockBlock owner

Assessment of instruction

Předmět neobsahuje žádné hodnocení.