Institute for Numerical and Applied Mathematics - Research Group Optimization

Profile of Sönke Behrends


 
Sönke Behrends
Institut für Numerische und Angewandte Mathematik
Lotzestraße 16-18
37083 Göttingen
 
Room 218
tel: +49 (0)551-39-22379
s.behrends@math.uni-goettingen.de
 

Research Interests


 
  • Mixed-integer optimization of polynomials
    • using methods from real algebraic geometry:
      • Stellensätze
      • sos programming
      • quantifier elimination
    • via geometric (non-algebraic) approaches:
      • Branch&Bound
      • level sets
      • cutting planes

 

Scientific Vita


 
since July 2013 Employee at the Institute for Numerical and Applied Mathematics of the University of Göttingen
Master thesis Lower Bounds for Polynomial Integer Minimization (Prof. Schöbel)
Sep. 2011 to May 2013 Studies of Mathematics (Master) at the University of Goettingen, minor subject Physics, grade: 1.0 (with distinction)
Sept. 2010 - July 2011 Studies abroad at the University of Warwick, UK
Bachelor thesis Sturm-Liouville-Operators (Prof. Bahns)
Oct. 2008 to Sep. 2011 Studies of Mathematics (B.Sc.) at the University of Göttingen, minor subject Physics
Bachelor thesis (Physics) Restriction of Quantum Fields to Hypersurfaces (Prof. Rehren)
Oct. 2006 to March 2010 Studies of Physics (B.Sc.) at the University of Göttingen
2005 Abitur (German school leaving examination)
1996 to 2005 Martin-Luther-Schule Marburg

 

Talks at Conferences and Workshops


 
  • Valid linear inequalities and nonlinear cutting planes for MINLP.
    International Conference on Operations Research (OR 2016) in Hamburg, Germany
  • On nonlinear cutting planes for mixed-integer nonlinear optimization.
    SIGOPT 2016 in Trier, Germany
  • The generation of nonlinear cutting planes for mixed-integer optimization of polynomials.
    Institute colloquium, Karlsruher Institut für Operations Research (KIT IOR) in Kalrsruhe, Germany
  • The bound function approach for solving nonlinear mixed-integer problems.
    International Conference on Operations Research (OR 2015) in Vienna, Austria
  • Mixed-Integer Optimization of Unconstrained Polynomials.
    International Symposium on Mathematical Programming (ISMP 2015) in Pittsburgh, USA
  • Approaching Mixed-Integer Nonlinear Optimization Problems.
    OptALI Industry Days in Kopenhagen, Denmark
  • Unconstrained polynomial integer minimization.
    DES Seminar Series in Auckland, New Zealand
  • Minimization of a polynomial over the integers.
    CSSE Seminar Series in Christchurch, New Zealand
  • Lower Bounds for Global Polynomial Integer Optimization.
    International Conference on Operations Research (OR 2014): Business Analytics and Optimization in Aachen, Germany
  • Global Polynomial Integer Optimization.
    Student Conference on Operational Research (SCOR14) in Nottingham, UK



Referierte Artikel in Zeitschriften




  • S. Behrends, R. Hübner, A. Schöbel. 2017. Norm Bounds and Underestimators for Unconstrained Polynomial Integer Minimization. Mathematical Methods of Operations Research. 1-35. online first.



Eingereichte Arbeiten




  • T. Bajbar, S. Behrends. 2017. How fast do coercive polynomials grow?. Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen.



Diese Veröffentlichungen als einzelne BibTeX-Datei: publications.bib


 

Teaching


 
  • Mathematik for beginning computer scientists I.
    TA and exercise group (winter term 2016/17)
  • Math propaedeutics for biology and geology.
    Lecture (winter term 2016/17)
  • Math propaedeutics for agricultural and forest sciences.
    Lecture (winter term 2016/17)
  • Math propaedeutics for biology and geology.
    Lecture (winter term 2015/16)
  • Math propaedeutics for agricultural and forest sciences.
    Lecture (winter term 2015/16)
  • Functional analysis.
    TA and exercise group (lecture in summer term 2015)
  • Algorithms for Integer Programming.
    TA and exercise group (lecture in winter term 2014/15)
  • Games and Puzzles.
    TA (block course in winter term 2014/15)
  • Introduction to optimization.
    TA and attestation of programming exercises (lecture in winter term 2014)
  • Algorithmic Game Theory.
    TA and exercise group (lecture in winter term 2013/14)