Optimization AlgorithmsModule description #41016 / Version 1
- 6 CP
- Written exam
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
Current version (v2)
| Module / Version | #41016 / #1 |
|---|---|
| Validity | Winter semester 2020/21 – Summer semester 2023 |
| Available language(s) | English, German |
| Credit points | 6 |
| Person responsible for the module | Toussaint, Marc |
| Grading | Graded |
| Exam format | Written exam |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Technische Informatik und Mikroelektronik |
| Academic chair | 34342100 FG Intelligent Systems |
Contact
| Office | MAR 4-4 |
|---|---|
| Contact person | Toussaint, Marc |
| E-mail address | office@lis.tu-berlin.de |
| Website | https://www.user.tu-berlin.de/mtoussai/teaching/index.html |
Learning outcomes
The students will be able to develop and apply optimization algorithms.
They can formulate real-world problems appropriately as mathematical programs.
They have a detailed understanding of the different categories of optimization problems, and methods to approach them.
They have a basic understanding of the theory behind and properties of optimization algorithms.
They have an overview of and experience with existing optimization software and are able to apply them to solve optimization problems.
They can formulate real-world problems appropriately as mathematical programs.
They have a detailed understanding of the different categories of optimization problems, and methods to approach them.
They have a basic understanding of the theory behind and properties of optimization algorithms.
They have an overview of and experience with existing optimization software and are able to apply them to solve optimization problems.
Content
The course is on continuous optimization problems, with focus on non-linear mathematical programming (constrained optimization).
Part 1 introduces efficient downhill algorithms in the unconstrained case:
* gradient descent, backtracking, Wolfe conditions, convergence properties
* covariant gradients, Newton, quasi-Newton methods, BFGS
Part 2 will introduce efficient algorithms for constrained optimization:
* Basics on KKT
* Log-barriers, Augmented Lagrangian, primal-dual Newton
* Phase I optimization
Part 3 will dive into large-scale, sparse, and structured solvers, dealing with non-convexity, and applications
* Existing libraries, CERES, structured NLPs, solving constraint graphs
* Optimization plus sampling to handle non-convexity
* Branch-and-bound-type methods
* Applications in AI, Robotics, & ML
Part 1 introduces efficient downhill algorithms in the unconstrained case:
* gradient descent, backtracking, Wolfe conditions, convergence properties
* covariant gradients, Newton, quasi-Newton methods, BFGS
Part 2 will introduce efficient algorithms for constrained optimization:
* Basics on KKT
* Log-barriers, Augmented Lagrangian, primal-dual Newton
* Phase I optimization
Part 3 will dive into large-scale, sparse, and structured solvers, dealing with non-convexity, and applications
* Existing libraries, CERES, structured NLPs, solving constraint graphs
* Optimization plus sampling to handle non-convexity
* Branch-and-bound-type methods
* Applications in AI, Robotics, & ML
Module components
Compulsory area
The following courses are mandatory for this module:
| Courses | Type | Number | Frequency | Language | Hours per week | Course catalog |
|---|---|---|---|---|---|---|
| Optimization Algorithms | Integrated course | Winter semester | [en] | 4 | WS 2026/27 (2) ISIS |
Courses in the course catalog
Courses created from the teaching units of this module.
Winter semester 2026/27 (2)
Optimization Algorithms (Integrated course) 2
Workload and credit points
Optimization Algorithms (Integrated course)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Attendance | 15 | 4 h | 60 h |
| Pre/post processing | 15 | 8 h | 120 h |
| 180 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
weekly lectures, exercise sessions, and homeworks
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Good knowledge in linear algebra and calculus
Basic programming knowledge, programming in C++ or Python
Basic programming knowledge, programming in C++ or Python
Mandatory requirements for the module examination registration:
The examination requirements could not be retrieved.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Written exam |
| Language | English |
| Duration/Extent | 120 min |
Duration of the module
The following number of semesters is estimated for taking and completing the module: 1 semester(s).
This module can be started in the following semesters: Winter semester.
Maximum number of participants
This module is not limited to a number of students.
Registration procedures
cf. course webpage
Recommended reading, lecture notes
Lecture notes
unavailable
Electronic lecture notes
unavailable
Recommended literature
No recommended literature given
Assigned programs
This module is not used in any program.
Miscellaneous
Not specified