Inhalt

[ 201NUOPOPTU18 ] UE Optimization

Versionsauswahl
(*) Unfortunately this information is not available in english.
Workload Education level Study areas Responsible person Hours per week Coordinating university
1,5 ECTS B3 - Bachelor's programme 3. year Mathematics Helmut Gfrerer 1 hpw Johannes Kepler University Linz
Detailed information
Original study plan Bachelor's programme Technical Mathematics 2025W
Learning Outcomes
Competences
Students are familiar with the basic concepts and methods of free and constrained optimisation and can apply known methods to practical problems.
Skills Knowledge
  • Understand the structure of free and constrained optimisation problems;
  • Know and apply statements on the existence and uniqueness of a solution;
  • be familiar with the Newton method and important variants;
  • know the conjugate gradient method;
  • know the tangent cone of a set;
  • understand the theoretical principles of linear optimisation;
  • know the basic algorithms of linear and quadratic optimisation;
Necessary and sufficient optimality conditions of first and second order; Line search algorithms; Newton methods; quasi-Newton methods; convergence statements for optimisation algorithms; Analytical statements on constrained optimisation; sequential quadratic programming methods.
Criteria for evaluation
Changing subject? No
Corresponding lecture (*)ist gemeinsam mit 201NUOPOPTV18: VL Optimierung (4,5 ECTS) äquivalent zu
TM1PDKVOPTI: KV Optimierung (6 ECTS)
On-site course
Maximum number of participants 25
Assignment procedure Direct assignment