BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//ALOP - ECPv6.17.4.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:ALOP
X-ORIGINAL-URL:https://alop.uni-trier.de
X-WR-CALDESC:Events for ALOP
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Europe/Berlin
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20150329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20151025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20160327T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20161030T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20170326T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20171029T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20180325T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20181028T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20190331T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20191027T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20200329T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20201025T010000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20210328T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20211031T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20200518T100000
DTEND;TZID=Europe/Berlin:20200528T120000
DTSTAMP:20200205T102052Z
CREATED:20200205T100739Z
LAST-MODIFIED:20200205T102052Z
UID:3343-1589796000-1590667200@alop.uni-trier.de
SUMMARY:Short Course on Optimization on Manifolds
DESCRIPTION:Prof. Dr. Volker Schulz\, Speaker of the Research Training Group on Algorithmic Optimization\, is offering a short course on the Optimization on Manifolds during the summer semester 2020. \nThe course will consist of several lectures of 90 minutes each. The exact dates and times will be announced shortly. \n  \nCourse Abstract to follow.
URL:https://alop.uni-trier.de/event/short-course-on-optimization-on-manifolds/
LOCATION:Trier University E Building\, Universitätsring 15\, Trier\, 54296\, Germany
CATEGORIES:Short Course
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20200504T100000
DTEND;TZID=Europe/Berlin:20200516T120000
DTSTAMP:20200205T102246Z
CREATED:20200205T102002Z
LAST-MODIFIED:20200205T102246Z
UID:3345-1588586400-1589630400@alop.uni-trier.de
SUMMARY:Short Course on Computational Statistics
DESCRIPTION:PD Dr. Jan Pablo Burgard\, a Principal Investigator with the Research Training Group on Algorithmic Optimization\, is offering a short course on Computational Statistics during the summer semester 2020. \nThe course will consist of several lectures of 90 minutes each. The exact dates and times will be announced shortly. \n  \nCourse Abstract to follow.
URL:https://alop.uni-trier.de/event/short-course-on-computational-statistics/
LOCATION:Trier University E Building\, Universitätsring 15\, Trier\, 54296\, Germany
CATEGORIES:Short Course
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20200129T140000
DTEND;TZID=Europe/Berlin:20200218T171500
DTSTAMP:20191017T124620Z
CREATED:20191017T123456Z
LAST-MODIFIED:20191017T124620Z
UID:3138-1580306400-1582046100@alop.uni-trier.de
SUMMARY:Short course on the Introduction to Mixed-Integer Nonlinear Optimization
DESCRIPTION:Prof. Dr. Martin Schmidt\, a Principal Investigator of the Research Training Group on Algorithmic Optimization\, is offering a short course on the Introduction to Mixed-Integer Nonlinear Optimization. \nThe course will consist of 4 x 2  lectures of 90 minutes each on the following dates and times: \nWednesday\,                     21 January 2020                     14:00 – 17:15                                              HS 10 \nWednesday\,                      5 February 2020                    14:00 – 17:15                                              HS 10 \nWednesday\,                     12 February 2020                   14:00 – 17:15                                              HS 10 \nTuesday\,                           18 February 2020                   14:00 – 17:15                                              HS 10 \nCourse Abstract: \nMixed-integer nonlinear optimization problems (MINLPs) are of great importance in practice because they allow for two crucial modeling aspects. First\, using integer variables makes it possible to model decision-making. Second\, accurate modeling of real-world phenomena often leads to nonlinearities like in physics or in models of economies of scale. However\, the combination of integer variables and nonlinearities also makes these problems extremely hard to solve for large-scale instances of real-world applications. \n  \nIn this compact course\, we introduce the class of convex and nonconvex MINLPs\, discuss some MINLP-specific modeling tricks\, and study the basic algorithms for solving MINLPs. \nFor a printout of this information\, please click here. \nCourse outline: \nDay 1: Introduction to the problem class of MINLPs\n* Definition of problem class\n* Convex vs. nonconvex MINLP\n* Modeling examples\n* Modeling techniques\n* Good and bad formulations\n* General algorithmic techniques for solving MINLPs \nDay 2: Algorithmic techniques\n* Nonlinear branch-and-bound\n* Kelley’s cutting plane method\n* Outer approximation\n* LP-/NLP-based branch-and-bound \nDay 3: Getting rid of what makes the problem hard\n* MIP-based solution techniques\n* NLP-based solution techniques \nDay 4: Nonconvex MINLPs and Software\n* Under- and overestimators\n* expression trees\n* Generic relaxation strategies for nonconvex MINLPs\n* Spatial branch-and-bound\n* Modeling software (GAMS\, AMPL\, Pyomo)\n* Solvers \n 
URL:https://alop.uni-trier.de/event/short-course-on-the-introduction-to-mixed-integer-nonlinear-optimization/
CATEGORIES:Short Course
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191125T120000
DTEND;TZID=Europe/Berlin:20191126T170000
DTSTAMP:20191115T102551Z
CREATED:20191107T134025Z
LAST-MODIFIED:20191115T102551Z
UID:3214-1574683200-1574787600@alop.uni-trier.de
SUMMARY:GUT Course scheduled for November 25- 26\, 2019
DESCRIPTION:Dr. Michael Mende with the University of Konstanz\, Germany is scheduled to teach a course on good scientific practice to the students of the Research Training Group on November 25 and 26\, 2019.  The event will take place in room V302.
URL:https://alop.uni-trier.de/event/gut-course-scheduled-for-november-25-26-2019/
LOCATION:Trier University\, E Building\, Universitätsring 15\, Trier\, Germany
CATEGORIES:Short Course
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20191118T120000
DTEND;TZID=Europe/Berlin:20191206T120000
DTSTAMP:20191010T093502Z
CREATED:20191009T124453Z
LAST-MODIFIED:20191010T093502Z
UID:3062-1574078400-1575633600@alop.uni-trier.de
SUMMARY:Short Course on Tensor Numerical Methods in Scientific Computing
DESCRIPTION:Prof. Dr. Boris Khoromskij   with the assistance of Dr. Venera Khoromskaia is offering a short course on Tensor Numerical Methods in Scientific Computing at Trier University on behalf of the Research Training Group on Algorithmic Optimization.  \nThe course will consist of several two hour lectures as follows: \nMonday\,                           18 Nov 2019                   12:00 – 14:00                                                E 52 \nTuesday\,                          19 Nov 2019                   10:00 – 12:00                                                E 45 \nWednesday\,                     20 Nov 2019                   14:00 – 16:00                                              HS 10 \nThursday\,                         21 Nov 2019                   14:00 – 16:00                                                E 10 \nFriday\,                               22 Nov 2019                  10:00 – 12:00                                                E 44 \nMonday\,                              2 Dec 2019                   12:00 – 14:00                                                E 52 \nTuesday\,                             3 Dec 2019                   10:00 – 12:00                                                E 45 \nWednesday\,                       4 Dec 2019                    14:00 – 16:00                                              HS 10 \nThursday\,                           5 Dec 2019                   12:00 – 14:00                                                E 10 \nFriday\,                                 6 Dec 2019                   10:00 – 12:00                                                E 44 \nCourse Abstract:\nSolution of multi-dimensional problems by traditional numerical methods suffer from the so-called “curse of dimensionality”\, that cannot be eliminated by using parallel architectures and high performance computing. The novel tensor numerical methods are based on a “smart” rank-structured tensor   representation of the multivariate functions and operators\, thus reducing solution of multidimensional integral-differential equations to 1D   calculations. We show how the canonical\, Tucker\, tensor train (TT)\, quantized-TT (QTT) and range-separated tensor approximations  provide the way to solve the multi-dimensional equations on  low-parametric rank-structured manifolds. We consider tensor methods for the elliptic optimal control problems\, for elliptic PDEs with oscillating coefficients and for some quantum chemical  models. Matlab exercises for the tensor decomposition algorithms will be provided. \nFor a printout of this information\, please click here. \n 
URL:https://alop.uni-trier.de/event/short-course-on-tensor-numerical-methods-in-scientific-computing/
CATEGORIES:Short Course
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20190528T083000
DTEND;TZID=Europe/Berlin:20190606T100000
DTSTAMP:20190520T060711Z
CREATED:20190509T124822Z
LAST-MODIFIED:20190520T060711Z
UID:2789-1559032200-1559815200@alop.uni-trier.de
SUMMARY:Short Course on Decomposition Based Methods for PDE Constrained Optimization
DESCRIPTION:Prof. Matthias Heinkenschloss with the Department of Computational and Applied Mathematics\, Rice University in Houston\, Texas is offering a short course on Decomposition Based Methods for PDE Constrained Optimization at Trier University on behalf of the Research Training Group on Algorithmic Optimization.  \nThe course will consist of three lectures\, with the tentative lecture schedule to follow soon. \nThe lectures will take place on the following dates and times: \nTuesday\, May 28\, 2019 at 8:30 in HS 9 \nTuesday\, June 4\, 2019 at 8:30 in HS 9\n \nThursday\, June 6\, 2019 at 8:30 c.t. in E 52\n \nFor a short description please refer to the attached document here. \nPlease refer back to this page for more information as it becomes available. \n 
URL:https://alop.uni-trier.de/event/2789/
LOCATION:Trier University\, E Building\, Universitätsring 15\, Trier\, Germany
CATEGORIES:Short Course
ORGANIZER;CN="RTG ALOP at Trier University":MAILTO:ALOP@uni-trier.de
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Europe/Berlin:20180605T083000
DTEND;TZID=Europe/Berlin:20180612T100000
DTSTAMP:20180605T112959Z
CREATED:20180322T123945Z
LAST-MODIFIED:20180605T112959Z
UID:1911-1528187400-1528797600@alop.uni-trier.de
SUMMARY:Short Course on Parallel Optimization Methods for Time Dependent Problems
DESCRIPTION:Prof. Matthias Heinkenschloss with the Department of Computational and Applied Mathematics\, Rice University in Houston\, Texas is offering a short course on Parallel Optimization Methods for Time Dependent Problems at Trier University on behalf of the Research Training Group on Algorithmic Optimization.  \nThe course will consist of three lectures\, with the tentative lecture schedule to follow soon. \nThe lectures will take place on the following dates and times: \nTuesday\, June 5\, 2018 at 8:30 c.t. in HS 10 \nThursday\, June 7\, 2018 at 8:30 c.t. in HS 9 \nTuesday\, June 12\, 2018 at 8:30 c.t. in HS10 \nPlease refer back to this page for more information as it becomes available. \n 
URL:https://alop.uni-trier.de/event/short-course-on-parallel-optimization-methods-for-time-dependent-problems/
LOCATION:Trier University E Building\, Universitätsring 15\, Trier\, 54296\, Germany
CATEGORIES:Short Course
ORGANIZER;CN="Research Training Group ALOP at Trier University":MAILTO:OptimizationDays@uni-trier.de
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20160621
DTEND;VALUE=DATE:20160701
DTSTAMP:20160623T091312Z
CREATED:20160623T084239Z
LAST-MODIFIED:20160623T091312Z
UID:352-1466467200-1467331199@alop.uni-trier.de
SUMMARY:Short Course on Reduced Order Work Models
DESCRIPTION:Prof. Matthias Heinkenschloss with the Department of Computational and Applied Mathematics\, Rice University in Houston\, Texas is offering a short course on Reduced Order Work Models at Trier University on behalf of the Research Training Group on Algorithmic Optimization.  \nThe following is an outline of the short course: \nMany applications require the repeated solution of partial differential equations (PDEs) for different input parameters or even the solution of optimization problems governed by PDEs. These tasks can be computationally expensive\, sometimes prohibitively expensive when carried out using only high fidelity PDE discretizations. Model order reduction systematically extracts key dynamics to generate low-order representations of the (high fidelity discretizations of the) PDEs so that quantities of interest generated from the PDE solutions are well approximated by these low-order representations. \nThis short course will introduce current methods for the computation of projection based reduced order models (ROMs)\, analyze the computational cost and the approximation properties of these ROMs\, and demonstrate their application on model PDEs. The second part of this course will introduce approaches for the integration of projection based ROMs into the solution of some classes of PDE constrained optimization problems. \nThe course will consist of five lectures\, with the tentative lecture schedule as follows: \n\n\nPDE model problems and their discretizations; PDE constrained optimization model problems and their discretizations; gradient and Hessian computations.\n\n\nThe Reduced Basis method and Proper Orthogonal Decomposition.\n\n\nThe (Discrete) Empirical Interpolation Method ( (D)EIM ).\n\n\nROMs for linear-quadratic PDE constrained optimization problems.\n\n\nApproaches and challenges for the use of ROMs in nonlinear PDE constrained optimization problems.\n\n\nThe short course on Reduced Order Work Models will take place beginning on Tuesday\, June 21\, 2016 through Thursday\, June 30\, 2016. \nFor more information on the exact times and lecture hall\, contact the organizer.
URL:https://alop.uni-trier.de/event/short-course-on-reduced-order-work-models/
CATEGORIES:Short Course
ORGANIZER;CN="Research Training Group ALOP at Trier University":MAILTO:OptimizationDays@uni-trier.de
END:VEVENT
END:VCALENDAR