Engineering systems and design problems can often be compactly described analyzed and manipulated using matrices and vectors. Moreover, tractable solutions to design problems can be obtained by casting the design problems as optimization problems. For the class of linear and quadratic problems, the solutions can be obtained by solving systems of equations. In computer programs, this is achieved via matrix factorizations. For the larger class of convex problems, no closed-form solution may exist and numerical methods must be applied. This course aims at teaching numerically robust methods for solving systems of equations and, more generally, convex optimization problems, including also standard constrained problems.
Lectures with exercises. Student projects on engineering application in their field
Prøvens navn | Matriksberegning og konveks optimering |
Prøveform | Skriftlig eller mundtlig |
ECTS | 5 |
Bedømmelsesform | Bestået/ikke bestået |
Censur | Intern prøve |
Vurderingskriterier | Som angivet i Fællesbestemmelser for uddannelser
http://www.tech.aau.dk/uddannelse/Studieadministration/ |
Engelsk titel | Matrix Computations and Convex Optimization |
Modulkode | ESNEITB6K2 |
Modultype | Kursus |
Varighed | 1 semester |
Semester | Forår
|
ECTS | 5 |
Tomplads | Ja |
Undervisningssted | Campus Aalborg |
Modulansvarlig |
Studienævn | Studienævnet for Elektronik og IT |
Institut | Institut for Elektroniske Systemer |
Fakultet | Det Tekniske Fakultet for IT og Design |