Purpose
Engineering systems and design problems can often be compactly
described analysed 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 closedform 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.
The programme is based on a combination of academic, problemoriented and interdisciplinary approaches and organised based on the following work and evaluation methods that combine skills and reflection:
Since it is a 5 ECTS course module, the work load is expected to be 150 hours for the student
Name of exam  Matrix Computation and Convex Optimization 
Type of exam  Written or oral exam 
ECTS  5 
Assessment  Passed/Not Passed 
Type of grading  Internal examination 
Criteria of assessment  As stated in the Joint Programme Regulations.
http://www.engineering.aau.dk/uddannelse/studieadministration/ 
Danish title  Matrix beregninger og Convex optimering 
Module code  NEDB64 
Module type  Course 
Duration  1 semester 
Semester  Spring

ECTS  5 
Emptyplace Scheme  Yes 
Location of the lecture  Campus Esbjerg 
Responsible for the module 
Study Board  Study Board of Energy 
Faculty  Faculty of Engineering and Science 
School  School of Engineering and Science 