# 376.058 Optimization This course is in all assigned curricula part of the STEOP.\$(function(){PrimeFaces.cw("Tooltip","widget_j_id_21",{id:"j_id_21",showEffect:"fade",hideEffect:"fade",target:"isAllSteop"});});This course is in at least 1 assigned curriculum part of the STEOP.\$(function(){PrimeFaces.cw("Tooltip","widget_j_id_23",{id:"j_id_23",showEffect:"fade",hideEffect:"fade",target:"isAnySteop"});}); 2022W 2021W 2020W 2019W 2018W 2017W 2016W 2015W 2014W 2013W

2021W, VU, 3.0h, 4.5EC

## Properties

• Semester hours: 3.0
• Credits: 4.5
• Type: VU Lecture and Exercise
• Format: Hybrid

## Learning outcomes

After successful completion of the course, students are able to identify, understand, analyze, formulate and graphically or mathematically solve basic static and dynamic optimization problems. They especially know about the theory, the mathematical principles and various methods for an exact or iterative solution of optimization problems. After successful completion of this course, students can moreover differentiate between unconstrained and constrained optimization problems and they can select and apply the specifically appropriate solution methods. This course strengthens and deepens engineering approaches, abstract and analytical thinking, independent solution of practical optimization problems, as well as mathematical skills.

## Subject of course

Fundamentals of optimization:
existence of minima and maxima, gradient, Hessian, convexity, convergence

Unconstrained static optimization:
optimality conditions, computer-aided optimization, line search methods, choice of the step length, principle of nested intervals, Armijo condition, Wolfe condition, gradient method, Newton method, conjugate gradient method, Quasi-Newton method, Gauss-Newton-method, trust region method, Nelder-Mead method

Static optimization with constraints:
equality and inequality constraints, sensitivity considerations, active set method, gradient projection method, reduced gradient method, penalty and barrier functions, sequential quadratic programming (SQP), local SQP, globalization of SQP

Dynamic optimization:
fundamentals of the calculus of variations, optimality conditions, Euler-Lagrange equations, Weierstrass-Erdmann conditions, design of optimal control solutions, minimum principle of Pontryagin,  energy-optimal, ressource-optimal, time-optimal, Bang-Bang control, direct vs. indirect methods, singular arcs

## Teaching methods

The contents of this lecture are elaborated and discussed based on lecture notes and exercise notes (both documents freely available). The material is presented on the blackboard and with slides. To deepen, reinforce, and practically apply the material, example problems are discussed and mathematically solved. The software Matlab is used for computer-aided solution of optimization problems. In some cases, the developed solutions are practically implemented and tested on laboratory experiments.

Oral

# Current information on the teaching mode in the winter semester 2021/2021

This course is taught in a hybrid format. This means that there are presence and distance learning events.

• Lecture: All lectures are exclusively held as online meetings via ZOOM at the times given in Course dates. A link to the ZOOM meetings is available in the associated TUWEL course. A course registration is required to access the TUWEL course.The first lecture (including a preview on the organization of the course) starts on 5.10.2021 at 8:00.

• Exercise: All four exercises are held as presence learning events in the computer lab of the institute ACIN (room CA0426). Each exercise consists of two parts. 1) Review and discussion of prepared problems, which are the basis for the presence event and which have to be solved beforehand. 2) Solution of further problems and in parts test on lab experiments.

Each exercise is scheduled for two hours and is offered with the same contents at two different dates. It is thus sufficient to attend one event per exercise. If required (e.g. because of entry restrictions at TU Wien), the exercises can be quickly switched to distance learning.

All contents of the exercises are part of the final exam. The goal of the exercises is to apply the theoretical concepts and algorithms presented in the lecture to specific examples in the field of static and dynamic optimization. The focus lies on the use of numeric software (mainly Matlab).

## Course dates

DayTimeDateLocationDescription
Tue08:00 - 10:0005.10.2021 - 25.01.2022 Online (Livestream)Lecture
Tue10:45 - 12:4509.11.2021Computerlabor E376, CA0426 Exercise 1, Group A
Wed13:15 - 15:1510.11.2021Computerlabor E376, CA0426 Exercise 1, Group B
Tue10:45 - 12:4523.11.2021Computerlabor E376, CA0426 Exercise 2, Group A
Wed13:15 - 15:1524.11.2021Computerlabor E376, CA0426 Exercise 2, Gruppe B
Tue10:45 - 12:4507.12.2021Computerlabor E376, CA0426 Exercise 3, Group A
Tue13:15 - 15:1507.12.2021Computerlabor E376, CA0426 Exercise 3, Group B
Tue10:45 - 12:4518.01.2022Computerlabor E376, CA0426 Exercise 4, Group A
Wed13:15 - 15:1519.01.2022Computerlabor E376, CA0426 Exercise 4, Group B
Optimization - Single appointments
DayDateTimeLocationDescription
Tue05.10.202108:00 - 10:00 Online (Livestream)Lecture
Tue12.10.202108:00 - 10:00 Online (Livestream)Lecture
Tue19.10.202108:00 - 10:00 Online (Livestream)Lecture
Tue09.11.202108:00 - 10:00 Online (Livestream)Lecture
Tue09.11.202110:45 - 12:45Computerlabor E376, CA0426 Exercise 1, Group A
Wed10.11.202113:15 - 15:15Computerlabor E376, CA0426 Exercise 1, Group B
Tue16.11.202108:00 - 10:00 Online (Livestream)Lecture
Tue23.11.202108:00 - 10:00 Online (Livestream)Lecture
Tue23.11.202110:45 - 12:45Computerlabor E376, CA0426 Exercise 2, Group A
Wed24.11.202113:15 - 15:15Computerlabor E376, CA0426 Exercise 2, Gruppe B
Tue30.11.202108:00 - 10:00 Online (Livestream)Lecture
Tue07.12.202108:00 - 10:00 Online (Livestream)Lecture
Tue07.12.202110:45 - 12:45Computerlabor E376, CA0426 Exercise 3, Group A
Tue07.12.202113:15 - 15:15Computerlabor E376, CA0426 Exercise 3, Group B
Tue14.12.202108:00 - 10:00 Online (Livestream)Lecture
Tue11.01.202208:00 - 10:00 Online (Livestream)Lecture
Tue18.01.202208:00 - 10:00 Online (Livestream)Lecture
Tue18.01.202210:45 - 12:45Computerlabor E376, CA0426 Exercise 4, Group A
Wed19.01.202213:15 - 15:15Computerlabor E376, CA0426 Exercise 4, Group B
Tue25.01.202208:00 - 10:00 Online (Livestream)Lecture

## Examination modalities

The performance is evaluated in an oral exam, which can take place at any time Monday to Friday from 6:00 to 20:00. To arrange a time for the examination, send an e-mail with desired dates, times or time slots, desired format (in presence or online), your name, student ID number, and study code to steinboeck@acin.tuwien.ac.at.

## Group dates

GroupDayTimeDateLocationDescription
Gruppe ATue10:45 - 12:4509.11.2021 Computerlabor E376, CA0426376.058 Optimization Gruppe A
Gruppe ATue10:45 - 12:4523.11.2021 Computerlabor E376, CA0426376.058 Optimization Gruppe A
Gruppe ATue10:45 - 12:4507.12.2021 Computerlabor E376, CA0426376.058 Optimization Gruppe A
Gruppe ATue10:45 - 12:4518.01.2022 Computerlabor E376, CA0426376.058 Optimization Gruppe A
Gruppe BWed13:15 - 15:1510.11.2021 Computerlabor E376, CA0426376.058 Optimization Gruppe B
Gruppe BWed13:15 - 15:1524.11.2021 Computerlabor E376, CA0426376.058 Optimization Gruppe B
Gruppe BTue13:15 - 15:1507.12.2021 Computerlabor E376, CA0426376.058 Optimization Gruppe B
Gruppe BWed13:15 - 15:1519.01.2022 Computerlabor E376, CA0426376.058 Optimization Gruppe B

## Course registration

Begin End Deregistration end
01.09.2021 00:00 06.02.2022 00:00

## Group Registration

GroupRegistration FromTo
Gruppe A06.10.2021 00:0107.11.2021 23:59
Gruppe B06.10.2021 00:0107.11.2021 23:59

## Curricula

Study CodeObligationSemesterPrecon.Info
066 453 Biomedical Engineering Not specified
066 504 Master programme Embedded Systems Not specified3. Semester
066 506 Energy Systems and Automation Technology Not specified3. Semester
066 507 Telecommunications Not specified3. Semester
066 938 Computer Engineering Mandatory elective