M7301 Mathematica programming

Faculty of Science
Autumn 2001
Extent and Intensity
2/1/0. 3 credit(s). Type of Completion: zk (examination).
Teacher(s)
prof. RNDr. Ondřej Došlý, DrSc. (lecturer)
Guaranteed by
prof. RNDr. Ondřej Došlý, DrSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: prof. RNDr. Ondřej Došlý, DrSc.
Prerequisites (in Czech)
M4110 Linear programming
Course Enrolment Limitations
The course is also offered to the students of the fields other than those the course is directly associated with.
fields of study / plans the course is directly associated with
Course objectives
I. Convex analysis. Convex sets: basic concepts, convex hull, separation and supporting hyperplanes. Convex Functions: basic concepts, convexity criteria for differentiable functions, subgradient and subdifferential, Fenchel transformation, system of linear and convex inequalities. II. Duality, necessary and sufficient conditions for optimality. Lagrange principle, Kuhn-Tucker conditions, casic concepts of convex progamming. Duality in mathematical programming, dual problem, Kuhn-Tucker vrctor, saddle point. Duality in special optimization problems {linear and quadratic}. III. Numerical methods of minimization. Onedimensional minimization {Fibonaci and golden ratio methods} Unconstrained optimization (steepest slope method, method of conjugate gradients, Newton method}. Quadratic programming {Wolfe method and modofications, Thiel van de Panne method}.
Language of instruction
Czech
Further Comments
The course can also be completed outside the examination period.
The course is taught annually.
The course is taught: every week.
The course is also listed under the following terms Autumn 1999, Autumn 2000.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/sci/autumn2001/M7301