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 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.
The programme is based on a combination of academic, problem-oriented 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
|Type of grading||Internal examination|
|Criteria of assessment||As stated in the Joint Programme Regulations.
|Danish title||Matrix beregninger og Convex optimering|
|Location of the lecture||Campus Esbjerg|
|Responsible for the module|
|Study Board||Study Board of Energy|
|Faculty||Faculty of Engineering and Science|