Convex Optimization for the Internet of ThingsModule description #40863 / Version 1
- 6 CP
- Portfolio examination
- Graded
- Winter semester
- English
This module description is not valid in the current semester (Winter semester 2026/27).
| Module / Version | #40863 / #1 |
|---|---|
| Validity | WS 2017/18 – SS 2019 |
| Available language(s) | English |
| Credit points | 6 |
| Person responsible for the module | Lucia Gil, Sergio |
| Grading | Graded |
| Exam format | Portfolio examination |
| Language(s) of instruction | English |
Affiliation
| Faculty | Fakultät IV |
|---|---|
| Institute | Institut für Telekommunikationssysteme |
| Academic chair | 34332500 FG Internet of Things for Smart Buildings |
Contact
| Office | Not specified |
|---|---|
| Contact person | Lucia Gil, Sergio |
| E-mail address | sergio.lucia@tu-berlin.de |
| Website | Not specified |
Learning outcomes
The students that successfully pass this module will know the fundamentals of convex optimization theory as well as several algorithms that are especially tailored for embedded applications. In addition, they will get familiar with the current literature in the field and have an overview about the challenges that different hardware architectures pose when solving optimization problems on embedded platforms.
Content
Convex optimization is a key element of modern automatic control and machine learning strategies. Due to the ubiquity of sensing, computing and actuating capabilities provided by the internet of things, convex optimization can be performed virtually anywhere, but it requires especial algorithms and methods for its deployment on embedded hardware with limited capabilities.
The first part of the lecture will discuss fundamentals of optimization theory and convexity, including unconstrained and constrained optimization techniques. Different algorithms that are especially suited for embedded applications, such as the accelerated gradient method, will be studied.
The second part of the lecture will discuss the challenges and particularities of the hardware that will be used to solve optimization problems in the context of the Internet of Things. In particular, the solution and programming of convex optimization problems using microcontrollers, Digital Signal Processors and Field Programmable Gate Arrays (FPGAs) will be studied.
Assessment includes a mini-project (short presentation and report) and an oral test.
The first part of the lecture will discuss fundamentals of optimization theory and convexity, including unconstrained and constrained optimization techniques. Different algorithms that are especially suited for embedded applications, such as the accelerated gradient method, will be studied.
The second part of the lecture will discuss the challenges and particularities of the hardware that will be used to solve optimization problems in the context of the Internet of Things. In particular, the solution and programming of convex optimization problems using microcontrollers, Digital Signal Processors and Field Programmable Gate Arrays (FPGAs) will be studied.
Assessment includes a mini-project (short presentation and report) and an oral test.
Module components
Compulsory area
The following courses are mandatory for this module:
Workload and credit points
Convex Optimization for the Internet of Things (Lecture)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 2 h | 30 h |
| 60 h | |||
Convex Optimization for the Internet of Things (Exercise)
| Workload description | Multiplier | Hours | Total |
|---|---|---|---|
| Präsenzzeit | 15 | 2 h | 30 h |
| Vor-/Nachbereitung | 15 | 6 h | 90 h |
| 120 h | |||
The workload of the module adds up to 180 hours. The module therefore comprises 6 credit points.
Description of teaching and learning methods
The lectures include frontal presentations mainly based on slides
The exercises include: written exercises for optimization theory, sessions for the preparation of mini-projects as well as for the presentation of the mini-projects
The exercises include: written exercises for optimization theory, sessions for the preparation of mini-projects as well as for the presentation of the mini-projects
Requirements for participation and examination
Desirable prerequisites for participation in the courses:
Basic algebra and programming skills
Mandatory requirements for the module examination registration:
This module has no examination requirements.
Completion of the module
| Grading | Graded |
|---|---|
| Exam format | Portfolio examination |
| Type of portfolio examination | 100 points in total |
| Language | English |
Test elements
| Name | Points/Weight | Category | Duration/Extent |
|---|---|---|---|
| Oral test | 50 | oral | 10 minutes |
| Presentation of mini-project | 20 | oral | 10 minutes |
| Report of the mini-project | 30 | written | 7-10 pages |
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
The maximum capacity of participants is 30.
Registration procedures
Anmeldung über das elektronische Anmeldesystem QISPOS
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