以下に参加して発表することになりました。。。
ICMS 2016 Session: Mathematical Optimization
ICMS 2016: Home, Sessions
Organizers
Ambros Gleixner (Zuse Institute Berlin, Germany)
Christian Kirches (IWR Heidelberg/TU Braunschweig, Germany)
John Mitchell (Rensselaer Polytechnic Institute, USA)
Ted Ralphs (Lehigh University, USA)
E-mail: icms_mathopt_2016zib.de
Aim and Scope
One out of four mathematical software packages listed in the database swMATH.org is categorized under the search term optimization. This indicates the prominent role of computational research in the field of optimization, and vice versa. This session aims at spanning the broad range of mathematical optimization software from algorithms for continuous, convex optimization that exploit strong duality theory to solver software for nonconvex problem classes, including packages that support the modeling process.
Recent developments that deserve special, though not exclusive attention are the integrated handling of nonconvex constraints from discrete and continuous optimization, the exploitation of increasingly available parallel hardware architecture, and arithmetically exact methods that render optimization a tool for mathematical theory exploitation. The session shall provide a forum for discussing common and distinct challenges and future trends.
ICMS 2016 Session: Mathematical Optimization
ICMS 2016: Home, Sessions
Organizers
Ambros Gleixner (Zuse Institute Berlin, Germany)
Christian Kirches (IWR Heidelberg/TU Braunschweig, Germany)
John Mitchell (Rensselaer Polytechnic Institute, USA)
Ted Ralphs (Lehigh University, USA)
E-mail: icms_mathopt_2016zib.de
Aim and Scope
One out of four mathematical software packages listed in the database swMATH.org is categorized under the search term optimization. This indicates the prominent role of computational research in the field of optimization, and vice versa. This session aims at spanning the broad range of mathematical optimization software from algorithms for continuous, convex optimization that exploit strong duality theory to solver software for nonconvex problem classes, including packages that support the modeling process.
Recent developments that deserve special, though not exclusive attention are the integrated handling of nonconvex constraints from discrete and continuous optimization, the exploitation of increasingly available parallel hardware architecture, and arithmetically exact methods that render optimization a tool for mathematical theory exploitation. The session shall provide a forum for discussing common and distinct challenges and future trends.