![]() |
Mats Werme, PhD
Division
of Optimization and Systems Theory
|
I received my M. Sc in Mechanical Engineering from the Royal Institute
of Technology (KTH) in 2001. My major was operations research and I wrote my master's thesis at Chalmers University of Technolgy with Professor Michael Patriksson as my advisor. The title of the thesis is Algorithms for Solving Non-Monotone Variational Inequalities.
Between January 2003 and March 2008, I was a PhD student at the division of Optimization and Systems Theory at KTH and my advisor was Professor Krister Svanberg. The main research area was Structural Optimization, dealing with theory and methods for optimal design of load-carrying structures. The title of my PhD thesis is On Methods for Discrete Topology Optimization.
Tillämpad matematisk programmering - ickelinjära problem, F,T,M, 5B1816 (fall 2005).
Tillämpad optimeringslära, T,M, 5B1722 (spring 2005).
Linjär och kvadratisk optimering, för T2, 5B1760 (fall 2003).
Systemteknik, del 1 (the course is also called 5B1842 Systemtekniska metoder), 5B1832 (fall 2003, fall 2005).
M. Werme, Using the sequential linear integer programming method as a post processor for stress constrained topology optimization problems. International Journal for Numerical Methods in Engineering
K. Svanberg and M. Werme, On the validity of using small positive lower bounds on design variables in discrete topology optimization. Structural and Multidisciplinary Optimization
K. Svanberg and M. Werme, Sequential integer programming methods for stress constrained topology optimization. Structural and Multidisciplinary Optimization 34 (2007), pp. 277-299
M. Werme, Globally optimal benchmark solutions to some small scale discretized continuum topology optimization problems. Structural and Multidisciplinary Optimization 32 (2006), pp. 259-262.
K. Svanberg and M. Werme, Topology optimization by a neighbourhood search method based on efficient sensitivity calculations. International Journal for Numerical Methods in Engineering 67 (2006), pp. 1670-1699.