BEGIN:VCALENDAR VERSION:2.0 PRODID:-//Computational Optimisation Group - ECPv6.15.11//NONSGML v1.0//EN CALSCALE:GREGORIAN METHOD:PUBLISH X-WR-CALNAME:Computational Optimisation Group X-ORIGINAL-URL:https://optimisation.doc.ic.ac.uk X-WR-CALDESC:Events for Computational Optimisation Group REFRESH-INTERVAL;VALUE=DURATION:PT1H X-Robots-Tag:noindex X-PUBLISHED-TTL:PT1H BEGIN:VTIMEZONE TZID:UTC BEGIN:STANDARD TZOFFSETFROM:+0000 TZOFFSETTO:+0000 TZNAME:UTC DTSTART:20150101T000000 END:STANDARD END:VTIMEZONE BEGIN:VTIMEZONE TZID:Europe/London BEGIN:DAYLIGHT TZOFFSETFROM:+0000 TZOFFSETTO:+0100 TZNAME:BST DTSTART:20180325T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0100 TZOFFSETTO:+0000 TZNAME:GMT DTSTART:20181028T010000 END:STANDARD BEGIN:DAYLIGHT TZOFFSETFROM:+0000 TZOFFSETTO:+0100 TZNAME:BST DTSTART:20190331T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0100 TZOFFSETTO:+0000 TZNAME:GMT DTSTART:20191027T010000 END:STANDARD BEGIN:DAYLIGHT TZOFFSETFROM:+0000 TZOFFSETTO:+0100 TZNAME:BST DTSTART:20200329T010000 END:DAYLIGHT BEGIN:STANDARD TZOFFSETFROM:+0100 TZOFFSETTO:+0000 TZNAME:GMT DTSTART:20201025T010000 END:STANDARD END:VTIMEZONE BEGIN:VTIMEZONE TZID:Europe/Paris 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 END:VTIMEZONE BEGIN:VEVENT DTSTART;TZID=UTC:20200323T140000 DTEND;TZID=UTC:20200323T150000 DTSTAMP:20260410T041543 CREATED:20200127T124815Z LAST-MODIFIED:20200317T114146Z UID:1446-1584972000-1584975600@optimisation.doc.ic.ac.uk SUMMARY:Seminar by Prof. Oliver Stein (Cancelled due to the Covid-19 situation) DESCRIPTION:Title: Pessimistic Bilevel Optimization \nPessimistic bilevel optimization problems\, as optimistic ones\, possess a structure involving\nthree interrelated optimization problems. Moreover\, their finite infima are only\nattained under strong conditions. We address these difficulties within a framework of moderate\nassumptions and a perturbation approach which allow us to approximate such finite\ninfima arbitrarily well by minimal values of a sequence of solvable single-level problems. \nTo this end\, as already done for optimistic problems\, we introduce the standard version of\nthe pessimistic bilevel problem. For its algorithmic treatment\, we reformulate it as a standard\noptimistic bilevel program with a two follower Nash game in the lower level. The latter lower level\ngame\, in turn\, is replaced by its Karush-Kuhn-Tucker conditions\, resulting in a single-level\nmathematical program with complementarity constraints. \nWe show that the perturbed pessimistic bilevel problem\, its standard version\, the\ntwo follower game as well as the mathematical program with complementarity constraints\nare equivalent with respect to their global minimal points. We also highlight the more intricate\nconnections between their local minimal points. As an illustration\, we consider a regulator problem\nfrom economics. \n  \nBio: \nOliver Stein is full professor at the Institute of Operations Research (IOR) at the Karlsruhe Institute of Technology (KIT).\nHe received his doctoral degree from the University of Trier in 1997\, and his venia legendi from RWTH Aachen University in 2002.\nHis research covers algorithms and their theoretical foundation for continuous and mixed-integer nonlinear optimization problems\,\nparametric optimization\, multi-leader-multi-follower games\, and multi-objective optimization. Oliver was fellow of the Friedrich-Ebert\nFoundation\, the Alexander-von-Humboldt Foundation\, and the German Research Foundation (Heisenberg followship)\, and received various\nteaching awards. Oliver is member of MOS\, SIAM\, GAMM\, GOR\, and DMV. Since 2015 he acts as Editor-in-Chief of MMOR. URL:https://optimisation.doc.ic.ac.uk/event/seminar-by-prof-oliver-stein/ LOCATION:CPSE lecture theatre END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20191206T140000 DTEND;TZID=UTC:20191206T153000 DTSTAMP:20260410T041543 CREATED:20191205T141856Z LAST-MODIFIED:20191205T141940Z UID:1432-1575640800-1575646200@optimisation.doc.ic.ac.uk SUMMARY:Seminar by Associate Professor Jakob Nordström DESCRIPTION:TITLE:\nLearn to Relax: Integrating Integer Linear Programming with Conflict-Driven Search\n\n  \nABSTRACT:\nPseudo-Boolean (PB) solvers optimize 0-1 integer linear programs by\nextending the conflict-driven learning paradigm from SAT solving.\nThough PB solvers should be exponentially more efficient than SAT\nsolvers in theory\, in practice they can sometimes get hopelessly stuck\neven when the relaxed linear program (LP) is infeasible over the\nreals.  Inspired by mixed integer programming (MIP)\, we address this\nproblem by interleaving incremental LP solving with cut generation\nwithin the conflict-driven PB search.  This hybrid approach\, which for\nthe first time combines MIP techniques with full-blown conflict\nanalysis over linear inequalities using the cutting planes method\,\nsignificantly improves performance on a wide range of benchmarks\,\napproaching a “best of two worlds” scenario between SAT-style\nconflict-driven search and MIP-style branch-and-cut. URL:https://optimisation.doc.ic.ac.uk/event/seminar-by-associate-professor-jakob-nordstrom/ LOCATION:Huxley 217 END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20191202T103000 DTEND;TZID=UTC:20191202T233000 DTSTAMP:20260410T041543 CREATED:20190723T135610Z LAST-MODIFIED:20190916T101732Z UID:1290-1575282600-1575329400@optimisation.doc.ic.ac.uk SUMMARY:Seminar by prof. Miguel Anjos DESCRIPTION:Professor Miguel Anjos from the University of Edinburgh is giving a seminar on: Tight-and-Cheap Conic Relaxations for AC Optimal Power Flow and Optimal Reactive Power Dispatch \n  \nAbstract: The classical alternating current optimal power flow problem is nonconvex and generally hard to solve. We propose a new conic relaxation obtained by combining semidefinite optimization with RLT. The proposed relaxation is stronger than the second-order cone relaxation\, competitive with the recently proposed QC relaxation\, and up to one order of magnitude faster than for the semidefinite chordal approach on benchmarks with up to 6515 nodes\, with comparable global bounds. We extend the approach to optimal reactive power dispatch\, which requires the introduction of binary and integer variables\, and obtain with similar results and performance. URL:https://optimisation.doc.ic.ac.uk/event/seminar-by-prof-miguel-anjos/ LOCATION:Huxley 217 END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20191128T140000 DTEND;TZID=UTC:20191128T153000 DTSTAMP:20260410T041543 CREATED:20191025T170003Z LAST-MODIFIED:20191025T170134Z UID:1418-1574949600-1574955000@optimisation.doc.ic.ac.uk SUMMARY:Seminar with Prof. Greg Sorkin: Extremal Cuts and Isoperimetry in Random Cubic Graphs DESCRIPTION:The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics\, and also because the minimum bisection of (general) cubic graphs plays a role in the construction of efficient exponential-time algorithms\, and it seems likely that random cubic graphs are extremal. \nIt is known that a random cubic graph has a minimum bisection of size at most 1/6 times its order (indeed this is known for all cubic graphs)\, and we reduce this upper bound to below 1/7 (to 0.13993) by analyzing an algorithm with a couple of surprising features. We increase the corresponding lower bound on minimum bisection using the Hamilton cycle model of a random cubic graph. We use the same Hamilton cycle approach to decrease the upper bound on maximum cut. We will discuss some related conjectures. URL:https://optimisation.doc.ic.ac.uk/event/seminar-with-prof-greg-sorkin-extremal-cuts-and-isoperimetry-in-random-cubic-graphs/ LOCATION:Huxley 217 END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190722T140000 DTEND;TZID=UTC:20190722T150000 DTSTAMP:20260410T041543 CREATED:20190703T163349Z LAST-MODIFIED:20190703T163349Z UID:1273-1563804000-1563807600@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Largest Small n-Polygons: Numerical Results and Conjectured Optima DESCRIPTION:Title: Largest Small n-Polygons: Numerical Results and Conjectured Optima \nSpeaker: János D. Pintér \nAffiliation: Department of Industrial and Systems Engineering\, Lehigh University \nLocation: 218 Huxley Building \nTime: 14:00 – 15:00 \n  \nAbstract. LSP(n)\, the largest small polygon with n vertices\, is defined as the polygon of unit diameter that\nhas maximal area A(n). Finding the configuration LSP(n) and the corresponding A(n) for even\nvalues n >= 6 is a long-standing challenge that can be also perceived as class of hard global\noptimization problems. We present numerical solution estimates for all even values 6 <= n <= 80\,\nusing the AMPL model development environment with the LGO global-local solver engine option.\nOur results are in close agreement with the results obtained by other researchers who tackled the\nproblem using exact approaches (for 6 <= n <= 20)\, and with the best results obtained using general\npurpose numerical optimization software (for selected values from the range 6 <= n <= 100). Based\non our numerical results\, we also present a regression model based estimate of {A(n)} for all even\nvalues n >= 6. \n  \nBio. János D. Pintér is a researcher and practitioner with over four decades of experience. His\ngeneral professional interests are related to Computational Optimization\, Data Analytics\, and\nOperations Research (O.R.). His more specific primary area of expertise is nonlinear optimization\,\nincluding model\, algorithm and software development\, with a range of applications.\nHe received his M.Sc. in the area of Applied Mathematics / Operations Research from\nEötvös Loránd University\, Hungary; Ph.D. in Probability Theory / Stochastic Optimization from\nMoscow State University; and D.Sc. in Mathematics / Global Optimization from the Hungarian\nAcademy of Sciences. \nAs of 2019\, Dr. Pintér wrote and edited ten books. He is also the author/co-author of more\nthan 200 journal articles\, book chapters\, proceedings contributions\, book reviews\, and research\nreports. His monograph titled Global Optimization in Action received the 2000 INFORMS\nComputing Society Prize for Research Excellence. \nAmong other professional affiliations\, he serves on the editorial board of the Journal of\nGlobal Optimization\, and he is an editor of the book series SpringerBriefs in Optimization. He also\nserved as Global Optimization vice-chair of the INFORMS Optimization Society\, and as a member\n(later chair) of the Managing Board of EUROPT. Currently\, he is a member of the Canadian and\nthe Hungarian Operations Research Societies\, INFORMS\, and EUROPT.\nHe has worked and presented lectures in about 40 countries of the Americas\, Europe\, the\nMiddle East\, and the Pacific Region. His LGO software – with links to modeling languages and\nscientific-technical computing systems – has been in use at hundreds of academic\, business\,\ngovernment\, and research organizations. \nIn 2016\, Dr. Pintér joined the Department of Industrial and Systems Engineering at Lehigh\nUniversity as a Professor of Practice. Since that time\, he has been teaching a range of O.R. related\ncourses for undergraduate and graduate students\, as well as ISE in-class and online (distance)\ncourses for healthcare engineering professionals. \n  URL:https://optimisation.doc.ic.ac.uk/event/seminar-largest-small-n-polygons-numerical-results-and-conjectured-optima/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/London:20190702T140000 DTEND;TZID=Europe/London:20190702T150000 DTSTAMP:20260410T041543 CREATED:20190425T090204Z LAST-MODIFIED:20190425T090204Z UID:1229-1562076000-1562079600@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Chordal Completions - Semidefinite Programming and Minimum Completions DESCRIPTION:Title: Chordal Completions – Semidefinite Programming and Minimum Completions\nSpeaker: Dr Arvind Raghunathan\nAffiliation: Mitsubishi Electric Research Laboratories (MERL)\nLocation: 217 Huxley Building\nTime: 14:00 – 15:00 \nAbstract. A graph is chordal if every cycle of length at least four contains a chord\, that is\, an edge connecting two nonconsecutive vertices of the cycle. Chordal completion of a given undirected graph G is a chordal graph\, on the same vertex set\, that has G as a subgraph. Several classical applications in sparse linear systems\, database management\, computer vision\, and SemiDefinite Programming (SDP) utilize chordal completions. The computation workload that results can be related to the number of edges that are added. Hence\, finding the minimum number of edges that makes a graph chordal is important. We refer to this as the Minimum Chordal Completion Problem (MCCP). In this talk\, we will present results on an application of completions in SDPs and the solution of MCCP. \nConversion approach\, a decomposition based on chordal completions\, is routinely used for solving large-scale SDPs. We show that the SDP resulting from the conversion approach is numerically degenerate under very mild assumptions. Numerical experiments on SDPLIB are provided to demonstrate the impact on solvers such as SDPT3 and SeDuMi. \nWe propose a new formulation for the MCCP which does not rely on finding perfect elimination orderings of the graph\, as has been considered in previous work. We introduce several families of facet-defining inequalities for cycle subgraphs. Numerical studies combining heuristic separation methods based on a threshold rounding and lazy-constraint generation indicate that our approach substantially outperforms existing methods for the MCCP\, solving many benchmark graphs to optimality for the first time. \nBiography. Arvind Raghunathan is a Senior Principal Scientist at Mitsubishi Electric Research Laboratories (MERL). His research interests are in the development of algorithms for the solution of nonlinear and mixed integer programming problems with applications in electric grid operations\, model predictive control\, and transportation. Arvind’s research has found business impact in Mitsubishi’s products and has won top technical honors within MERL and Mitsubishi Electric Corporation. Arvind currently serves as an associate editor for Optimization & Engineering journal and as an expert of ANSI on the ISO Working Group on Smart Transportation. He obtained a Ph.D. from Carnegie Mellon University and a B.Tech from Indian Institute of Technology (Madras) both in Chemical Engineering. He worked for United Technologies Research Center for 7 years prior to joining MERL. URL:https://optimisation.doc.ic.ac.uk/event/seminar-chordal-completions-semidefinite-programming-and-minimum-completions/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/London:20190628T140000 DTEND;TZID=Europe/London:20190628T150000 DTSTAMP:20260410T041543 CREATED:20190610T073147Z LAST-MODIFIED:20190610T073147Z UID:1254-1561730400-1561734000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Extremal Cuts and Isoperimetry in Random Cubic Graphs DESCRIPTION:Title: Extremal Cuts and Isoperimetry in Random Cubic Graphs\nSpeaker: Prof. Gregory B. Sorkin\nAffiliation: Dept of Mathematics\, The London School of Economics and Political Science (LSE)\nLocation: LT139 Huxley Building\nTime: 14:00 – 15:00 \nAbstract. The minimum bisection width of random cubic graphs is of interest because it is one of the simplest questions imaginable in extremal combinatorics\, and also because the minimum bisection of (general) cubic graphs plays a role in the construction of efficient exponential-time algorithms\, and it seems likely that random cubic graphs are extremal. \nIt is known that a random cubic graph has a minimum bisection of size at most 1/6 times its order (indeed this is known for all cubic graphs)\, and we reduce this upper bound to below 1/7 (to 0.13993) by analyzing an algorithm with a couple of surprising features. We increase the corresponding lower bound on minimum bisection using the Hamilton cycle model of a random cubic graph. We use the same Hamilton cycle approach to decrease the upper bound on maximum cut. We will discuss some related conjectures. URL:https://optimisation.doc.ic.ac.uk/event/seminar-extremal-cuts-and-isoperimetry-in-random-cubic-graphs/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/London:20190502T150000 DTEND;TZID=Europe/London:20190502T160000 DTSTAMP:20260410T041543 CREATED:20190410T081937Z LAST-MODIFIED:20190410T081937Z UID:1223-1556809200-1556812800@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Robust Discrete Optimization: Globalized Gamma Robustness and Radius of Robust Feasibility DESCRIPTION:Title: Robust Discrete Optimization: Globalized Gamma Robustness and Radius of Robust Feasibility\nSpeaker: Prof. Dr Frauke Liers\nAffiliation: Dept of Mathematics\, FAU Erlangen-Nürnberg\nLocation: 217 Huxley Building\nTime: 15:00 – 16:00 \nAbstract. In this talk\, we extend the notion of two robust optimization methodologies that were originally introduced for continuous problems towards robust discrete tasks. On the one hand\, we look at globalized robust optimization that has been proposed as a generalization of the standard robust optimization framework in order to allow for a controlled decrease in protection. It depends on the distance of the realized from the predefined uncertainty set. In this talk\, we specialize the notion of globalized robustness to Gamma-uncertainty in order to extend its usability for discrete optimization. We show that the generalized robust counterpart possesses algorithmically tractable reformulations for mixed-integer linear nominal problems that use only slightly more variables and constraints than the standard robust counterpart under Gamma-uncertainty. For combinatorial problems\, our globalized robust counterpart remains fixed-parameter tractable\, although with a runtime exponential in Gamma. In computational studies\, it turns out that our algorithmically tractable reformulations are not more difficult to solve than the respective standard robust counterparts\, while globalized robustness is guaranteed. Secondly\, we extend the notion of determining the radius of robust feasibility for a mixed integer linear problem (MIP) with uncertain constraints. The radius of robust feasibility (RRF) determines a value for the maximal size of the uncertainty set such that robust feasibility of the MIP can be guaranteed. We will analyze relations between the RRF of a MIP and its continuous relaxation. In contrast to the general setting of the literature\, we extend the concept to computing the RRF to MIPs that might include safe constraints. Finally\, we apply our methods to the standard benchmark set of the MIPLIB in order to test their performance and analyze the price of robustness with respect to the RRF.The work about Globalized Gamma Robustness is joint with Andreas Bärmann (FAU Erlangen-Nürnberg\, Germany) and Christina Büsing (RWTH Aachen\, Germany). The work about the radius of robust feasibility is joint with Lars Schewe and Johannes Thürauf (both FAU Erlangen-Nürnberg\, Germany) URL:https://optimisation.doc.ic.ac.uk/event/seminar-robust-discrete-optimization-globalized-gamma-robustness-and-radius-of-robust-feasibility/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/London:20190502T133000 DTEND;TZID=Europe/London:20190502T143000 DTSTAMP:20260410T041543 CREATED:20190410T081934Z LAST-MODIFIED:20190410T081934Z UID:1222-1556803800-1556807400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Exact and heuristic MIP methods for the solution of MINLP - Examples from gas transport optimization problems DESCRIPTION:Title: Exact and heuristic MIP methods for the solution of MINLP – Examples from gas transport optimization problems\nSpeaker: Dr Lars Schewe\nAffiliation: Dept of Mathematics\, FAU Erlangen-Nürnberg\nLocation: 217 Huxley Building\nTime: 13:30 – 14:30 \nAbstract. In this talk\, we present exact and heuristic methods for MINLP\, the development of which was motivated by applications in gas transport optimization. In this talk\, we present a sample of our approaches and focus on provable results for both the exact and the heuristic methods. The methods have been applied on both academic and real-world instances. We first discuss how to solve MINLPs using a hierarchy of piece-wise linear relaxations and discuss a convergence result for such an algorithm. We show how this algorithm performs on problems in instationary gas transport. We then show how we can use a combination of penalty and alternating-direction methods to solve difficult instances of gas transport optimization problems and on instances from the MINLPLib. For these methods\, we can also give convergence results and discuss their relation to feasibility pump methods. URL:https://optimisation.doc.ic.ac.uk/event/seminar-exact-and-heuristic-mip-methods-for-the-solution-of-minlp-examples-from-gas-transport-optimization-problems/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/London:20190425T110000 DTEND;TZID=Europe/London:20190425T120000 DTSTAMP:20260410T041543 CREATED:20190416T132348Z LAST-MODIFIED:20190416T132348Z UID:1226-1556190000-1556193600@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Data-Driven Methods for Integrated Production Scheduling and Process Control DESCRIPTION:Title: Data-Driven Methods for Integrated Production Scheduling and Process Control\nSpeaker: Calvin Tsay\nAffiliation: McKetta Dept of Chemical Engineering\, University of Texas at Austin\nLocation: 218 Huxley Building\nTime: 11:00 – 12:00 \nAbstract. Due to the fast-changing market conditions enabled by globalization and modern infrastructures\, industrial production scheduling is often performed over relatively short time intervals to maximize profits. For chemical processes\, plant dynamics and control become highly relevant at these shortened time intervals\, and careful attention is required to ensure computed schedules are feasible when implemented in the physical process. With this motivation\, many recent works focused on integrating dynamic information from the process control layer into production scheduling. Unfortunately\, the resulting optimization problems are high-dimensional and often intractable because of the broad range of time scales involved. \nIn this presentation\, we describe data-driven techniques for learning low-order dynamic models of the behavior of a process and its controller (i.e.\, “closed-loop” behavior). Then\, we formulate an optimal scheduling problem involving the learned\, reduced-order representation of the relevant dynamics. Furthermore\, we present a data-mining approach that exploits historical process data to reduce the dimensionality of the aforementioned dynamic models. Throughout the presentation\, we will focus on applications to the scheduling of industrial air separation units\, which consume immense amounts of electricity\, in response to time-varying electricity prices (an operational strategy termed “demand response”). Several case studies will be presented\, ranging from model-based analyses to a real-world application on an industrial air separation unit. URL:https://optimisation.doc.ic.ac.uk/event/seminar-data-driven-methods-for-integrated-production-scheduling-and-process-control/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190226T140000 DTEND;TZID=UTC:20190226T150000 DTSTAMP:20260410T041543 CREATED:20190214T121614Z LAST-MODIFIED:20190214T143922Z UID:1212-1551189600-1551193200@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Generalized maximum entropy estimation DESCRIPTION:Title: Generalized maximum entropy estimation\nSpeaker: Dr David Sutter\nAffiliation: Institute for Theoretical Physics\, ETH Zurich\nLocation: 217 Huxley Building\nTime: 14:00 – 15:00 \nAbstract. We consider the problem of estimating a probability distribution that maximizes the entropy while satisfying a finite number of moment constraints\, possibly corrupted by noise. Based on duality of convex programming\, we present a novel approximation scheme using a smoothed fast gradient method that is equipped with explicit bounds on the approximation error. \nThis is joint work with T. Sutter\, P. Esfahani\, and J. Lygeros (arXiv:1708.07311). \nBiography. Dr David Sutter is a postdoctoral researcher at ETH Zurich\, working on mathematical aspects of quantum information theory. He obtained his PhD degree from the Institute for Theoretical Physics at ETH Zurich under the supervision of Prof. Renato Renner. Dr Sutter’s interests lie in the intersection of quantum mechanics\, information theory\, and mathematical physics. To understand the fundamental limits of information processing and communications\, he utilizes tools from matrix analysis\, optimization theory and probability theory. URL:https://optimisation.doc.ic.ac.uk/event/seminar-generalized-maximum-entropy-estimation/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20190206T160000 DTEND;TZID=UTC:20190206T170000 DTSTAMP:20260410T041543 CREATED:20190123T095139Z LAST-MODIFIED:20190123T095139Z UID:1208-1549468800-1549472400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Model-based design of optimal experiments using exact confidence regions DESCRIPTION:Title: Model-based design of optimal experiments using exact confidence regions\nSpeaker: Dr Radoslav Paulen\nAffiliation: Institute of Information Engineering\, Automation and Mathematics\, Slovak University of Technology\nLocation: 218 Huxley Building\nTime: 16:00 – 17:00 \nAbstract. This talk discusses a model-based optimal experiment design (OED) for nonlinear systems. OED represents a methodology for optimizing the geometry of the parametric joint-confidence regions\, which are obtained in an a posteriori analysis of the parameter estimates. The optimal design is achieved by using the available (experimental) degrees of freedom such that more informative measurements are obtained. Unlike the commonly used approaches\, which base the OED procedure upon the linearized CRs\, we explore a path where we explicitly consider the exact CRs in the OED framework. We use a methodology for a finite parameterization of the exact CRs within the OED problem. The employed techniques give the OED problem as a finite-dimensional mathematical program of a bilevel nature. We discuss the use of several solution techniques tailored to the problem. Finally\, we illustrate the methodology on few small-scale case studies and compare the resulting optimal designs with the commonly used linearization-based approach. \nBiography. Dr Radoslav Paulen currently works at the Institute of Information Engineering\, Automation and Mathematics at Slovak University of Technology in Bratislava. He does research in Modelling\, Parameter Estimation\, Optimization and Advanced Control of Dynamic Systems. The group of Dr Paulen concentrates on research in estimation and optimal control of nonlinear dynamic systems with applications in chemical and biochemical processes. The main research topics include (i) guaranteed and statistical parameter estimation\, and (ii) dynamic optimization\, global optimization\, predictive control. URL:https://optimisation.doc.ic.ac.uk/event/seminar-model-based-design-of-optimal-experiments-using-exact-confidence-regions/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20181128T160000 DTEND;TZID=UTC:20181128T170000 DTSTAMP:20260410T041543 CREATED:20180907T201315Z LAST-MODIFIED:20181126T205541Z UID:1145-1543420800-1543424400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Capacity upper bounds for deletion-type channels DESCRIPTION:Title: Capacity upper bounds for deletion-type channels\nSpeaker: Dr Mahdi Cheraghchi\nAffiliation: Dept of Computing\, Imperial College London\nLocation: 218 Huxley Building\nTime: 16:00 – 17:00 \nAbstract. We develop a systematic approach\, based on convex programming and real analysis\, for obtaining upper bounds on the capacity of the binary deletion channel and\, more generally\, channels with i.i.d. insertions and deletions. Other than the classical deletion channel\, we give a special attention to the Poisson-repeat channel introduced by Mitzenmacher and Drinea (IEEE Transactions on Information Theory\, 2006). Our framework can be applied to obtain capacity upper bounds for any repetition distribution (the deletion and Poisson-repeat channels corresponding to the special cases of Bernoulli and Poisson distributions). Our techniques essentially reduce the task of proving capacity upper bounds to maximizing a univariate\, real-valued\, and often concave function over a bounded interval. We show the following: \n1. The capacity of the binary deletion channel with deletion probability $d$ is at most $(1-d)log(phi)$ for $d > 1/2$\, and\, assuming the capacity function is convex\, is at most $1-d log(4/phi)$ for $d<1/2$\, where $phi=(1+sqrt{5})/2$ is the golden ratio. This is the first nontrivial capacity upper bound for any value of $d$ outside the limiting case $d to 0$ that is fully explicit and proved without computer assistance. \n2. We derive the first set of capacity upper bounds for the Poisson-repeat channel. \n3. We derive several novel upper bounds on the capacity of the deletion channel. All upper bounds are maximums of efficiently computable\, and concave\, univariate real functions over a bounded domain. In turn\, we upper bound these functions in terms of explicit elementary and standard special functions\, whose maximums can be found even more efficiently (and sometimes\, analytically\, for example for $d=1/2$). \nAlong the way\, we develop several new techniques of potentially independent interest in information theory\, probability\, and mathematical analysis. \n[Based on an article published in proceedings of ACM STOC 2018] \nBiography. Dr Mahdi Cheraghchi is a Lecturer in the Department of Computing at Imperial College London. Previously\, he has been a Qualcomm Research Fellow at the Simons Institute for the Theory of Computing of U.C. Berkeley and have held post-doctoral researcher positions at the MIT Computer Science and Artificial Intelligence Lab\, Computer Science Department of the Carnegie Mellon University and the University of Texas at Austin. He received his PhD in Computer Science from EPFL\, Switzerland\, where he worked as a research assistant in the Laboratory of Algorithms (ALGO) under the supervision of Amin Shokrollahi. Dr Cheraghchi main research interest is in the field of Theoretical Computer Science. URL:https://optimisation.doc.ic.ac.uk/event/seminar-capacity-upper-bounds-for-deletion-type-channels/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20181116T150000 DTEND;TZID=UTC:20181116T160000 DTSTAMP:20260410T041543 CREATED:20181001T084447Z LAST-MODIFIED:20181001T084617Z UID:1158-1542380400-1542384000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Arrangements of Circles and Spheres leading to Convex Hulls with Minimal Boundaries DESCRIPTION:Title: Arrangements of Circles and Spheres leading to Convex Hulls with Minimal Boundaries\nSpeaker: Dr Josef Kallrath\nAffiliation: Advanced Business Analytics\, BASF SE\, Germany\nLocation: 218 Huxley Building\nTime: 15:00 – 16:00 \nAbstract. We present and solve a new computational geometry optimization problem in 2D and 3D and provide theoretical insights. Circles (2D) and Spheres (3D) with given radii should be arranged in such a way that a) they do not overlap and b) the length of the perimeter or surface area\, resp.\, of the boundary ∂S of the convex hull S enclosing the spheres is minimized. An additional constraint could be to fit the spheres into a specified geometry\, e.g.\, a rectangle or a rectangular solid\, respectively. \nA motivation for the 2D problem is a rope to be minimized\, which encloses the circles\, where the circles could be the base of cylinders loaded an a truck with rectangular loading area. \nIn 2D\, ∂S is established by line segments and circular arcs. To tackle the problem\, we derive a non-convex mixed-integer non-linear programming (MINLP) formulation. We exploited the isoperimetric inequality to get a tighter lower bound for the perimeter than the lower bound obtained by the relaxation of the MINLP. As demonstrated in numerical experiments\, problem instances with only congruent circles are computational better tractable than non-congruent instances\, as for congruent instances only the line segments have to be minimized. For small instances with up to five non-congruent circles\, and minimizing only lL the MINLP problems we obtained gaps smaller than 10−4 with the current state-of-the-art global solvers BARON and LINDO available in GAMS. For larger problems of up to 90 circles\, the relative gap between the upper and lower bound provided by the global solvers remains larger than 7 %. \nIn 3D\, ∂S consists of spherical polygons with k vertices formed by k arcs of great circles\, triangles and truncated cones. Here\, we take a different approach than in the 2D situation. Similarly as in modeling the surface of eclipsing binary stars\, we cover the surface of the spheres by a grid of approximately uniformly distributed points using spherical coordinates. We derive closed non-convex NLP models for this sphere arrangement problem. \nFor two spheres\, we prove that the minimal area of ∂S is identical to the sum of the surface areas of the two spheres. For special configurations of spheres we provide theoretical insights and compute analytically minimal area configurations. Numerically\, we have solved problems containing up to 200 spheres using a polylithic modeling and solution approach. URL:https://optimisation.doc.ic.ac.uk/event/seminar-arrangements-of-circles-and-spheres-leading-to-convex-hulls-with-minimal-boundaries/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20181003T150000 DTEND;TZID=Europe/Paris:20181003T160000 DTSTAMP:20260410T041543 CREATED:20181001T080116Z LAST-MODIFIED:20181001T084704Z UID:1154-1538578800-1538582400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Random projections in mathematical programming DESCRIPTION:Title: Random projections in mathematical programming\nSpeaker: Dr Leo Liberti\nAffiliation: CNRS LIX\, École Polytechnique\nLocation: 218 Huxley Building\nTime: 15:00 – 16:00 \nAbstract. In the algorithmic trade-off between generality and efficiency\, sometimes the only way out is to accept approximate methods. If all else fails\, we can always fall back on heuristic methods. But some form of approximation guarantee is usually preferable. In this talk we shall discuss a set of approximating reformulations to various classes of mathematical programming problems involving matrices. Random projections are a dimensionality reduction methodology which projects a set of vectors into a much lower dimensional space\, so that the projected vector set is approximately congruent to the original one with high probability. The probability of failure falls exponentially fast as the dimension increases\, making this a truly “big data” methodology. We shall show how to apply this methodology to Linear and Conic Programming\, as well as (bounded) Quadratic Programming. We shall discuss applications to Quantile Regression and Error-Correcting Codes. \nBiography. Dr Leo Liberti is CNRS Research Director (and part-time professor) at CNRS LIX (the Computer Science Laboratory) of École Polytechnique\, France. Dr Liberti did his undergraduate studies in mathematics at Imperial College London and the University of Turin. He received his Ph.D. from Imperial College London in 2004 and HDR (French professorship diploma) from Paris-Dauphine University\, Paris\, France in 2007. His main research interests are in (i) reformulations in mathematical programming\, (i) mixed-integer nonlinear programming (MINLP)\, global and combinatorial optimization\, (iii) distance geometry and bioinformatics\, and (iv) complex industrial systems and sustainable development. URL:https://optimisation.doc.ic.ac.uk/event/seminar-random-projections-in-mathematical-programming/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20180525T140000 DTEND;TZID=Europe/Paris:20180525T150000 DTSTAMP:20260410T041543 CREATED:20180427T070629Z LAST-MODIFIED:20180427T070629Z UID:1135-1527256800-1527260400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: More Virtuous Smoothing and Embracing the Ghost of Rolle DESCRIPTION:Title: More Virtuous Smoothing and Embracing the Ghost of Rolle\nSpeaker: Prof Jon Lee\nAffiliation: Industrial and Operations Engineering\, College of Engineering\, University of Michigan\nLocation: LT 308 Huxley Building\nTime: 14:00 – 15:00 \nAbstract. In the context of global optimization of mixed-integer nonlinear optimization formulations\, we consider smoothing univariate concave increasing functions that have poorly behaved derivative at 0 (for example\, root functions). Extending earlier work of Lee and Skipper\, we give general conditions under which our smoothing is concave and increasing\, is an underestimator\, and dominates a simple “shift smoothing”. \nThis is joint work with Luze Xu and Daphne Skipper. \nBiography. Jon is the G. Lawton and Louise G. Johnson Professor of Engineering and also Professor of Industrial and Operations Engineering\, in the College of Engineering at the University of Michigan\, Ann Arbor. He is an Affiliate of CHEPS (The Center for Healthcare Engineering and Patient Safety)\, MIDAS (Michigan Institute for Data Science)\, MCAIM (Michigan Center for Applied and Interdisciplinary Mathematics)\, and of MICDE (Michigan Institute for Computational Discovery and Engineering). \nCurrently\, Jon is Editor-in-Chief of the journal Mathematical Programming (Series A)\, Editorial Board Member of the journal Optimization and Engineering\, and Editorial Board Member of the journal Discrete Applied Mathematics. Jon is a Permanent Member of DIMACS\, and a Full Member of the COIN-OR Foundation. URL:https://optimisation.doc.ic.ac.uk/event/seminar-more-virtuous-smoothing-and-embracing-the-ghost-of-rolle/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20180425T140000 DTEND;TZID=Europe/Paris:20180425T150000 DTSTAMP:20260410T041543 CREATED:20180319T142205Z LAST-MODIFIED:20180319T142644Z UID:1056-1524664800-1524668400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Computing Pessimistic Leader-Follower Equilibria with Multiple Followers DESCRIPTION:Title: Computing Pessimistic Leader-Follower Equilibria with Multiple Followers\nSpeaker: Dr Stefano Coniglio\nAffiliation: Dept. of Mathematical Sciences\, Southampton University\nLocation: Room 217 Huxley Building\nTime: 14:00 – 15:00 \nAbstract. We investigate the problem of computing a Leader-Follower equilibrium in Stackelberg games where two or more followers react to the strategy chosen by the (single) leader by playing a Nash Equilibrium. We consider two natural cases\, the optimistic one where the followers select a Nash Equilibrium maximizing the leader’s utility and the pessimistic one where they select an equilibrium minimizing the leader’s utility. We first illustrate that\, in both cases\, computing a Leader-Follower Nash equilibrium is NP-hard and not in Poly-APX unless P=NP\, and that even deciding whether one of the leader’s actions would be played with strictly positive probability is NP-hard. We then focus on the pessimistic case with followers restricted to pure strategies\, showing that this problem too is NP-hard and not in Poly-APX unless P=NP. After casting it as a pessimistic bilevel programming problem\, we propose an exact implicit enumeration algorithm for its solution. In particular\, our algorithm is capable of computing the maximum of the problem and\, for the general case where the former only admits a supremum\, an alpha-approximate strategy for any nonnegative alpha. Experimental results are presented and illustrated\, showing the viability of the proposed approach. \nThis is joint work with Nicola Gatti and Alberto Marchesi. \nAbout the speaker. Dr Stefano Coniglio is a Lecturer in Operational Research within Mathematical Sciences at the University of Southampton. Dr Stefano Coniglio joined the University of Southampton as Lecturer in Operational Research within Mathematical Sciences in February 2016. Prior to that\, he served as Research Associate at the RWTH Aachen University\, Germany\, and as Postdoctoral Researcher at Politecnico di Milano\, Italy\, where he received his Ph.D. in Information Technology in 2011. His research focuses on exact methods for the solution of mathematical programming and combinatorial optimization problems. Recently\, he has been most active in bilevel programming\, robust optimization\, and methodological aspects of cutting plane generation\, with applications to algorithmic game theory\, optimization in telecommunication networks\, energy production planning\, and data mining. URL:https://optimisation.doc.ic.ac.uk/event/seminar-computing-pessimistic-leader-follower-equilibria-with-multiple-followers/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=Europe/Paris:20180417T140000 DTEND;TZID=Europe/Paris:20180417T153000 DTSTAMP:20260410T041543 CREATED:20180410T110415Z LAST-MODIFIED:20180410T110415Z UID:1055-1523973600-1523979000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Large neighbourhood Benders' search DESCRIPTION:Title: Large neighbourhood Benders’ search\nSpeaker: Dr. Stephen Maher\nAffiliation: Lancaster University Management School\nLocation: Room 218 Huxley Building\nTime: 14:00 – 15:30 \nAbstract. Enhancements for the Benders’ decomposition algorithm can be derived from large neighbourhood search (LNS) heuristics. While mixed-integer programming (MIP) solvers are endowed with an array of LNS heuristics\, their use is typically limited in bespoke Benders’ decomposition implementations. To date\, only ad hoc approaches have been developed to enhance the Benders’ decomposition algorithm using large neighbourhood search techniques—namely local branching and proximity search. A general implementation of Benders’ decomposition has been developed within the MIP solver SCIP to permit a greater use of LNS heuristics with the expectation that it will enhance the solution algorithm. Benders’ decomposition is employed for all LNS heuristics to improve the quality of the identified solutions and generate additional cuts that can be used to improve the convergence of the main solution algorithm. Focusing on the heuristics of proximity search\, RINS and DINS\, the results will demonstrate the value of using Benders’ decomposition within LNS. URL:https://optimisation.doc.ic.ac.uk/event/seminar-large-neighbourhood-benders-search/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20180119T111500 DTEND;TZID=UTC:20180119T123000 DTSTAMP:20260410T041543 CREATED:20180105T143648Z LAST-MODIFIED:20180105T143707Z UID:1024-1516360500-1516365000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: ADMM and Random Walks on Graphs DESCRIPTION:Title: ADMM and Random Walks on Graphs\nSpeaker: Prof. José Bento\nAffiliation: Dept. of Computer Science\, Boston College\nLocation: Room 217 Huxley Building\nTime: 11:15am – 12:30pm \nAbstract. A connection between the distributed alternating direction method of multipliers (ADMM) and lifted Markov chains was recently proposed by Franca et al. 2016 for a non-strictly-convex consensus problem parametrized by a graph G. This was followed by a conjecture that ADMM is faster than gradient descent by a square root factor in its convergence time\, in close analogy to the mixing speedup achieved by lifting several Markov chains. Nevertheless\, a proof was lacking. In this talk\, I will start by revisiting Franca’s conjecture. Afterwards\, I will fully characterize the distributed over-relaxed ADMM for this consensus problem in terms of the topology of the graph G.  To be specific\, I will relate its convergence rate with the mixing time of random walks on the graph G. A consequence of this result is a proof of the aforementioned conjecture\, which\, interestingly\, is valid for any graph\,  even those whose random walks cannot be accelerated via Markov chain lifting. \nAbout the speaker. José Bento completed his Ph.D. in Electrical Engineering at Stanford University where he worked with Professor Andrea Montanari on statistical inference and structural learning of graphical models. After his Ph.D.\, he moved to Disney Research\, Boston lab\, where he worked with Dr. Jonathan Yedidia on algorithms for distributed optimization\, robotics\, and computer vision. He is now with the Computer Science department at Boston College. His current research lies at the intersection of distributed algorithms and machine learning. In 2014 he received a Disney Inventor Award for his work on distributed optimization\, which recently lead to an approved patent. In 2016 he was awarded a $10M NIH joint grant to study the emergence of antibiotic resistance and in 2017 a $2M NSF joint grant to study measures of distance between large graphs. URL:https://optimisation.doc.ic.ac.uk/event/seminar-admm-and-random-walks-on-graphs/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20171121T140000 DTEND;TZID=UTC:20171121T150000 DTSTAMP:20260410T041543 CREATED:20171029T101434Z LAST-MODIFIED:20171029T101434Z UID:1012-1511272800-1511276400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Stochastic Vehicle Routing: an Overview and some Recent Advances DESCRIPTION:Title: Multi-level Optimization by multi-parametric programming & its use for the solution of Mixed Integer Adjustable Robust Optimization Problems\nSpeaker: Prof. Michel Gendreau\nAffiliation: Dept. of Mathematics and Industrial Engineering\, Polytechnique Montréal\nLocation: LG19a\, Business School\nTime: 2:00pm \nAbstract. While Vehicle Routing Problems have now been studied extensively for more than 50 years\, those in which some parameters are uncertain at the time where the routes are made have received significantly less attention\, in spite of the fact that there are many real-life settings where key parameters are not known with certainty. \nIn the first part of this talk\, we will examine the main classes of Stochastic Vehicle Routing Problems: problems with stochastic demands\, stochastic customers\, and stochastic service or travel times. We will emphasize the main approaches for modeling and tackling uncertainty: a priori models\, a posteriori approaches\, and chance-constrained models.  The second part of the talk will devoted to a presentation of some of our recent work in the area. \nAbout the speaker. Michel Gendreau is Department Chair and Professor of Operations Research in the Department of Mathematics and Industrial Engineering of Polytechnique Montréal (Canada). He received both his M.Sc. and his Ph.D. degrees from University of Montreal. His main research area is the application of operations research methods to a wide range of problem areas: transportation and logistics systems planning and operation\, energy production and storage\, healthcare\, and telecommunications. Dr. Gendreau has published more than 300 papers in peer-reviewed journals and conference proceedings. He is also the co-editor of six books dealing with transportation planning and scheduling\, as well as with metaheuristics. \nDr. Gendreau was the Director of the Centre for Research on Transportation (formerly CRT and now CIRRELT) from 1999 to 2007. He completed his 6-year term as Editor in chief of Transportation Science at the end of 2014. In 2001\, he received the Merit Award of the Canadian Operational Research Society in recognition of his contributions to the development of O.R. in Canada. He was elected Fellow of INFORMS in 2010. In 2015\, Dr. Gendreau received the prestigious Robert Herman Lifetime Achievement Award of the Transportation Science & Logistics Society of INFORMS. URL:https://optimisation.doc.ic.ac.uk/event/seminar-stochastic-vehicle-routing-an-overview-and-some-recent-advances/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20171114T160000 DTEND;TZID=UTC:20171114T170000 DTSTAMP:20260410T041543 CREATED:20170921T091809Z LAST-MODIFIED:20170921T091809Z UID:989-1510675200-1510678800@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Multi-level Optimization by multi-parametric programming & its use for the solution of Mixed Integer Adjustable Robust Optimization Problems DESCRIPTION:Title: Multi-level Optimization by multi-parametric programming & its use for the solution of Mixed Integer Adjustable Robust Optimization Problems\nSpeaker: Prof. Stratos Pistikopoulos\, FREng\nAffiliation: Artie McFerrin Department of Chemical Engineering\, Texas A&M University\nLocation: Room 217 Huxley Building\nTime: 4:00pm \nAbstract. Optimization problems involving multiple decision makers at different decision levels are referred to as multi-level programming problems. We are considering bi-level (two decision levels) and tri-level (three decision levels) programming problems. Multi-level programming problems are very challenging to solve even when considering just two linear decision levels. For classes of problems where the lower level problems also involve discrete variables\, this complexity is further increased\, typically requiring global optimization methods for its solution. Solution approaches for mixed integer bi-level problems with discrete variables in both levels mainly include reformulation approaches\, branch and bound techniques or genetic algorithms\, all of which result in approximate solutions. \nIn this work\, we present novel algorithms for the exact\, global and parametric solution of two classes of multi-level programming problems\, namely (i) bi-level mixed-integer linear or quadratic programming problems (B-MILP or B-MIQP) and (ii) tri-level mixed-integer linear or quadratic programming problems (T-MILP or T-MIQP) containing both integer and continuous variables at all optimization levels. Based on multi-parametric theory and our earlier results for bi-level programing problems [5\, 6]\, the main idea is to recast the lower levels of the multi-level programming problem as multi-parametric programming problems\, in which the optimization variables of all the upper level problems\, both continuous and integer\, are considered as parameters for the lower level problems. \nThis novel algorithm can be then used for the exact and global solution of adjustable robust optimization problems. Classical robust optimization (RO) is an approach for incorporating uncertainty in optimization problems\, and traditionally assumes that all decisions must be made before the realization of uncertainty (referred to as “here-and-now” decisions)\, a strategy which may be overly conservative. A more realistic approach is adjustable robust optimization (ARO) which involves recourse decisions (i.e. reactive actions after the realization of the uncertainty\, “wait-and-see”) as functions of the uncertainty\, typically posed in a two-stage stochastic setting. We propose a novel method for the derivation of generalized affine decision rules for linear/quadratic/nonlinear and mixed-integer ARO problems through multi-parametric programming. The problem is treated as a multi-level programming problem that can be then solved using the presented algorithm. A set of illustrative numerical examples are provided to demonstrate the potential of the proposed novel approach. \nAbout the speaker. Professor Pistikopoulos is TEES Distinguished Research Professor in the Artie McFerrin Department of Chemical Engineering at Texas A&M University. He was a Professor of Chemical Engineering at Imperial College London\, UK (1991-2015) and the Director of its Centre for Process Systems Engineering (2002-2009). At Texas A&M\, he is the Interim Co-Director & Deputy Director of the Texas A&M Energy Institute\, the Course Director of the Master of Science in Energy\, the Director of the Gulf Coast Regional Manufacturing Centre\, and the Texas A&M Principal Investigator of the RAPID Institute on process intensification\, co-leading the Modeling & Simulation Focus Area. \nHe holds a Ph.D. degree from Carnegie Mellon University and he worked with Shell Chemicals in Amsterdam before joining Imperial. He has authored or co-authored over 400 major research publications in the areas of modelling\, control and optimization of process\, energy and systems engineering applications\, 12 books and 2 patents. He is a Fellow of IChemE and AIChE\, and the Editor-in-Chief of Computers & Chemical Engineering. He is the current Chair of the Computing and Systems Technology (CAST) Division of AIChE and he serves as a trustee of the Computer Aids for Chemical Engineering (CACHE) Organization. In 2007\, Prof. Pistikopoulos was a co-recipient of the prestigious MacRobert Award from the Royal Academy of Engineering. In 2012\, he was the recipient of the Computing in Chemical Engineering Award of CAST/AIChE. He received the title of Doctor Honoris Causa in 2014 from the University Politehnica of Bucharest\, and from the University of Pannonia in 2015. In 2013\, he was elected Fellow of the Royal Academy of Engineering in the UK. URL:https://optimisation.doc.ic.ac.uk/event/seminar-multi-level-optimization-by-multi-parametric-programming-its-use-for-the-solution-of-mixed-integer-adjustable-robust-optimization-problems/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20171027T160000 DTEND;TZID=UTC:20171027T170000 DTSTAMP:20260410T041543 CREATED:20171011T095354Z LAST-MODIFIED:20171011T095354Z UID:1001-1509120000-1509123600@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Robust Model Predictive Control DESCRIPTION:Title: Robust Model Predictive Control\nSpeaker: Dr. Saša V. Raković\nLocation: Room 218 Huxley Building\nTime: 4:00pm \nAbstract. \nModel predictive control (MPC) is an advanced control technique that employs an open–loop online optimization in order to take account of system dynamics\, constraints and control objectives and to obtain the best current control action. Robust MPC (RMPC) is an improved MPC form that is robust against the bounded uncertainty. RMPC employs a generalized prediction framework that allows for a meaningful optimization of\, and over\, the set of possible system behaviours effected by the uncertainty. A real intricacy in RMPC arises due to the facts that the exact RMPC provides strong structural properties but it is computationally unwieldy\, while the conventional MPC is not necessarily robust even though it is computationally convenient. \nThe seminar focuses on novel RMPC methods\, developed through my research investigations and collaborations\, that address effectively the fundamental challenge of reaching a meaningful compromise between the quality of guaranteed structural properties and the associated computational complexity. In particular\, the talk discusses flexible and efficiently optimizable parameterizations as well as tube MPC\, which lead to synthesis methods that are theoretically sound (i.e.\, they guarantee a–priori strong structural properties) and computationally efficient (i.e.\, they have a manageable computational complexity that is close enough to that of the conventional MPC synthesis). \nAbout the speaker. \nDr. Saša V. Raković received the Ph.D. degree in Control Theory from Imperial College London. His Ph.D. thesis\, entitled “Robust Control of Constrained Discrete Time Systems: Characterization and Implementation”\, was awarded the Eryl Cadwaladr Davies Prize as the best Ph.D. thesis in the Electrical and Electronic Engineering Department of Imperial College London in 2005. (This award is presented annually to the Ph.D. student who produces the best thesis during the academic year.) \nDr. Saša V. Raković has been affiliated with a number of the leading international universities\, including Imperial College London\, ETH Zürich\, Oxford University\, UMD at College Park\, UT at Austin and Texas A&M University at College Station. \nDr. Saša V. Raković’s research spans the broad areas of autonomy\, controls\, dynamics\, systems\, applied mathematics\, optimization and set–valued analysis. His current research activity is focused on problems encountered in\, or closely related to\, the fields of smart autonomous and cyber-physical systems\, and that belong to the intersection of controls\, dynamics\, systems and optimization. Dr. Saša V. Raković has authored 95 publications\, most of which are highly cited (i.e.\, more than 3600 citations according to Google Scholar) and which are published in leading international journals and proceedings of key conferences in the related fields. \nDr. Saša V. Raković is best known for his research in model predictive control that has made significant contributions to theory\, computation and implementation of conventional\, robust and stochastic model predictive control. Dr. Saša V. Raković is one of the global leaders in robust model predictive control\, and one of the key pioneers of the tube model predictive control framework. Tube model predictive control has been recognized as a milestone contribution to\, and a major paradigm shift in\, model predictive control under uncertainty. \nDr. Saša V. Raković’s most important work in analysis of dynamics and control synthesis via optimization and set–valued methods has dealt with previously long–standing problems. Inter alia\, Zvi Artstein and Saša V. Raković have resolved important problems concerned with minimality of invariant sets and set invariance under output feedback. Dr. Saša V. Raković has also significantly expanded classical results on the linear quadratic Lyapunov equations by developing theory and computations for Minkowski–Lyapunov equations\, namely Lyapunov equations within the class of generic vector semi–norms. URL:https://optimisation.doc.ic.ac.uk/event/seminar-robust-model-predictive-control/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20170925T140000 DTEND;TZID=UTC:20170925T150000 DTSTAMP:20260410T041543 CREATED:20170921T091147Z LAST-MODIFIED:20170921T091419Z UID:987-1506348000-1506351600@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Prediction of Stock market crashes\,entry exits from bubbles\, hedge fund disasters and their prevention DESCRIPTION:Title: Prediction of Stock market crashes\,entry exits from bubbles\, hedge fund disasters and their prevention\nSpeaker: Prof. William T. Ziemba\nAffiliation: Sauder School of Business\, University of British Columbia\nLocation: LG19b Seminar Room\, Business School\nTime: 2:00pm \nAbstract. Bubbles occur in financial markets from time to time. By a bubble we mean that the prices are going up just because people expect them to continue rising. In these cases the prices exceed the fair value based on fundamentals. Jarrow and his colleagues have developed tests for the existence of such bubbles. While that is interesting our main focus is on can we predict when the bubble like market-not necessarily a strict bubble will crash. For this we use the BSEYD and other models. The BSEYD model suggests a crash of 10%+ is coming in the next year or so from the signal date when the long bond interest rate exceeds the earnings yield of stocks by a critical amount. The idea is that bonds and stocks compete for the investment dollar and when interest rates relative to earnings are too high a crash is likely. The talk will discuss the history of this signal in US\, Japanese and other markets since I discovered it in Japan based on the US 1987 stock market crash in 1988. Besides a crash signal the BSEYD model is useful for long term asset allocation. I will discuss three other large crash models one based on behavorial finance relating to overconfidence measured by the put and call options market. Famed investor Warren Buffett has a measure based on the value of the economy to the value of the stock market. While the way buffett presents it the measure value of the economy to the stock market does not predict. The measure can be fixed to actually predict. The fourth measure is the value of Sotheby’s stock. This then provides signals to exit markets but does not tell you when to exit. The BSEYD signal did give correct calls in two instances where the world’s most famous bubble trader George Soros shorted too soon and lost a lot of money namely the nikkei stock average in 1988 (BSEYD signal in April 1989) and the Nasdaq 100 in 1998-9(BSEYD signal in April 1999). The issue of when to exit we analyze using an approach developed with two Russian colleagues. The idea is that there is a rising trend then a peak then a decline. That model is based on research of Shiraev modified by Zhitlukhin for our purpose here. We apply it to apple computer stock in 2012\, to the Nasdaq in circa 1990\, to the Nikkei stock average in 1989\, to the bigger bubble golf course membership market in the same circa 1989-90 period\, to the 1987 and 1929 stock market crashes in the united states. In general the exits are very good. This model is also useful for shorts as well as longs with somewhat different interpretation as a trading tool. The talk also discusses famed market guru Marty Zweigs prediction methods based on fed movements and momentum and small partially anticipated decides based on economics and political events such as the Brexit\, Trump and French elections. These are useful in futures trading. \nAbout the speaker. Dr William T. Ziemba is the Alumni Professor (Emeritus) of Financial Modeling and Stochastic Optimization in the Sauder School of Business\, University of British Columbia where he taught from 1968-2006. His PhD is from the University of California\, Berkeley. He currently teaches part time and makes short research visits at various universities. Recently he is the Distinguished Visiting Research Associate\, Systemic Risk Centre\, London School of Economics. He has been a visiting professor at Cambridge\, Oxford\, London School of Economics\, University of Reading and Warwick in the UK\, at Stanford\, UCLA\, Berkeley\, MIT\, University of Washington and Chicago in the US\, Universities of Bergamo\, Venice and Luiss in Italy\, the Universities of Zurich\, Cyprus\, Tsukuba (Japan)\, KAIST (Korea) and the National University and the National Technological University of Singapore. \nHe has been a consultant to a number of leading financial institutions including the Frank Russell Company\, Morgan Stanley\, Buchanan Partners\, RAB Hedge Funds\, Gordon Capital\, Matcap\, Ketchum Trading and\, in the gambling area\, to the BC Lotto Corporation\, SCA Insurance\, Singapore Pools\, Canadian Sports Pool\, Keeneland Racetrack and some racetrack syndicates in Hong Kong\, Manila and Australia. His research is in asset-liability management\, portfolio theory and practice\, security market imperfections\, Japanese and Asian financial markets\, hedge fund strategies\, risk management\, sports and lottery investments and applied stochastic programming. His co-written practitioner paper on the Russell-Yasuda model won second prize in the 1993 Edelman Practice of Management Science Competition. He has been a futures and equity trader and hedge fund and investment manager since 1983. \nHe has published widely in journals such as Operations Research\, Management Science\,\, Mathematics of OR\, Mathematical Programming\, American Economic Review\, Journal of Economic Perspectives\, Journal of Finance\, Journal of Economic Dynamics and Control\, JFQA\, Quantitative Finance\, Journal of Portfolio Management and Journal of Banking and Finance and in many books and special journal issues. \nRecent books include Applications of Stochastic Programming with S.W. Wallace\, SIAM-MPS\, 2005\, Stochastic Optimization Models in Finance\, 2nd edition with R.G. Vickson\, World Scientific\, 2006 and Handbook of Asset and Liability Modeling\, Volume 1: Theory and Methodology (2006) and Volume 2: Applications and Case Studies (2007) with S. A. Zenios\, North Holland\, Scenarios for Risk Management and Global Investment Strategies with Rachel Ziemba\, Wiley\, 2007\, Handbook of Investments: Sports and Lottery Betting Markets\, with Donald Hausch\, North Holland\, 2008\, Optimizing the Aging\, Retirement and Pensions Dilemma with Marida Bertocchi and Sandra Schwartz and The Kelly Capital Growth Investment Criterion\, 2010\, with legendary hedge fund trader Edward Thorp and Leonard MacLean\, Calendar Anomalies and Arbitrage\, The Handbook of Financial Decision Making (with Leonard MacLean) and Stochastic Programming (with Horand Gassman)\, published by World Scientific in 2012 and 2013. In progress in 2014 are Handbooks on the Economics of Wine (with O. Ashenfelter\, O. Gergaud and K. Storchmann) and Futures (with T. Mallaris) \nHe is the series editor for North Holland’s Handbooks in Finance\, World Scientific Handbooks in Financial Economics and Books in Finance\, and previously was the CORS editor of INFOR and the department of finance editor of Management Science\, 1982-1992. He has continued his columns in Wilmott and his 2013 book with Rachel Ziemba have the 2007-2013 columns updated with new material published by World Scientific. Ziemba\, along with Hausch\, wrote the famous Beat the Racetrack book (1984 (which was revised into Dr Z’s Beat the Racetrack (1987)\, which presented their place and show betting system and the Efficiency of Racetrack Betting Markets (1994\, 2008) – the so-called bible of racetrack syndicates. Their 1986 book Betting at the Racetrack extends this efficient/inefficient market approach to simple exotic bets. Ziemba is revising BATR into Exotic Betting at the Racetrack (World Scientific) which adds Pick3\,4\,5\,6\, etc and provides updates to be out in the spring 2014. URL:https://optimisation.doc.ic.ac.uk/event/seminar-prediction-of-stock-market-crashesentry-exits-from-bubbles-hedge-fund-disasters-and-their-prevention/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20170120T150000 DTEND;TZID=UTC:20170120T150000 DTSTAMP:20260410T041543 CREATED:20170116T143747Z LAST-MODIFIED:20170116T144626Z UID:419-1484924400-1484924400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Stochastic reformulations of linear systems and efficient randomized algorithms DESCRIPTION:Title: Stochastic reformulations of linear systems and efficient randomized algorithms\nSpeaker: Dr. Peter Richtarik\nAffiliation: School of Mathematics\, University of Edinburgh\nLocation: Room 217 Huxley Building\nTime: 3:00pm \nAbstract. We propose a new paradigm for solving linear systems. In our paradigm\, the system is reformulated into a stochastic problem\, and then solved with a randomized algorithm. Our reformulation can be equivalently seen as a stochastic optimization problem\, stochastically preconditioned linear system\, stochastic fixed point problem and as a probabilistic intersection problem. We propose and analyze basic\, parallel and accelerated stochastic algorithms for solving the reformulated problem\, with linear convergence rates. \nAbout the speaker. Peter Richtarik is a Reader in the School of Mathematics at the University of Edinburgh\, and is the Head of a Big Data Optimization Lab. He received his PhD from Cornell University in 2007\, and currently holds an EPSRC Early Career Fellowship in Mathematical Sciences. His main research focus is the development of new optimization algorithms and theory. In particular\, much of his recent work is in the emerging field of big data optimization\, with applications in machine learning in general and empirical risk minimization in particular. For big data optimization problems\, traditional methods are no longer suitable\, and hence there is need to develop new algorithmic paradigms. An important role in this respect is played by randomized algorithms of various flavors\, including randomized coordinate descent\, stochastic gradient descent\, randomized subspace descent and randomized quasi-Newton methods. Parallel and distributed variants are of particular importance. URL:https://optimisation.doc.ic.ac.uk/event/seminar-stochastic-reformulations-of-linear-systems-and-efficient-randomized-algorithms/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20161213T133000 DTEND;TZID=UTC:20161213T133000 DTSTAMP:20260410T041543 CREATED:20170116T144707Z LAST-MODIFIED:20170116T145403Z UID:422-1481635800-1481635800@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Smart Grids and Optimization - A Winning Combination DESCRIPTION:Title: Smart Grids and Optimization – A Winning Combination\nSpeaker: Prof. Miguel Anjos\nAffiliation: Polytechnique Montreal\nLocation: Room 217 Huxley Building\nTime: 1:30pm (1 hour) \nAbstract. A smart grid is the combination of a traditional electrical power system with information and energy both flowing back and forth between suppliers and consumers. This new paradigm introduces major challenges such as the integration of intermittent generation and storage\, and the need for electricity consumers to play an active role in the operations of the system. We will summarize the opportunities provided by smart grid to the optimization community\, and illustrate one such opportunity through some recent research on optimal aggregation of energy resources (joint work with F. Gilbert\, P. Marcotte\, and G. Savard). \nAbout the speaker. Miguel Anjos is a Professor at Polytechnique Montreal. He holds a Canada Research Chair and an Inria International Chair. He is also a licensed professional engineer in Ontario\, Canada. His research is concerned with using mathematical optimization to provide guaranteed optimal or near-optimal solutions for important classes of large-scale discrete nonlinear optimization problems arising in engineering applications. URL:https://optimisation.doc.ic.ac.uk/event/seminar-smart-grids-and-optimization-a-winning-combination/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20161206T150000 DTEND;TZID=UTC:20161206T150000 DTSTAMP:20260410T041543 CREATED:20170116T145225Z LAST-MODIFIED:20170116T145225Z UID:425-1481036400-1481036400@optimisation.doc.ic.ac.uk SUMMARY:Seminar: On Bit Representations of Mixed-Integer Quadratic Programs. DESCRIPTION:Title: On Bit Representations of Mixed-Integer Quadratic Programs.\nSpeaker: Prof. Adam Letchford\nAffiliation: Management School – Lancaster University\nLocation: Room 217 Huxley Building\nTime: 3:00pm (1 hour) \nAbstract. A standard trick in integer programming is to replace each bounded general-integer variable with a small number of binary variables\, using the bit representation of the given variable. (See\, e.g.\, Owen & Mehrotra\, 2002; Coppersmith & Lee\, 2005; Muldoon et al.\, 2013; Bonami & Margot\, 2015). Recently\, bit representation was found to be useful for convexifying quadratic problems (Billionnet et al.\, 2012) and for linearising bilinear problems (Gupte et al.\, 2013). We show that\,in the case of mixed-integer quadratic programs\, bit representation has an additional benefit: it can enable one to obtain stronger linear programming relaxations. \nAbout the speaker. Adam N. Letchford is known internationally for his research on exact solution methods for NP-hard optimisation problems. He has been the recipient of an IBM Faculty Award and an EPSRC Advanced Research Fellowship\, and is a Fellow of the Operational Research Society. He has been on the editorial boards of six journals\, including Mathematical Programming and Operations Research. From 2008-2014\, he was the coordinator of the optimisation cluster of the LANCS Initiative. Since 2012\, he has been the director of NATCOR\, the UK National Taught Course Centre in Operational Research. URL:https://optimisation.doc.ic.ac.uk/event/seminar-on-bit-representations-of-mixed-integer-quadratic-programs/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20161205T150000 DTEND;TZID=UTC:20161205T150000 DTSTAMP:20260410T041543 CREATED:20170116T145614Z LAST-MODIFIED:20170116T145614Z UID:428-1480950000-1480950000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Solution of an old problem in vector optimisation - Support function of the generalised Jacobian DESCRIPTION:Title: Solution of an old problem in vector optimisation – Support function of the generalised Jacobian\nSpeaker: Prof. Abbas Edalat\nAffiliation: Department of Computing – Imperial College\nLocation: Room 217 Huxley Building\nTime: 3:00pm (1 hour) \nAbstract. Many optimisation problems are non-smooth in the sense that the objective function is not differentiable. This is invariably the case in many areas of application when the objective function contains simple constructs such as maximum or minimum of several differentiable functions or contains\, for example\, the absolute value function. The notion of the Clarke sub-gradient of locally Lipschitz maps has been used successfully in the past decades to solve non-smooth non-convex optimisation problems by methods such as the sub-gradient descent or the more powerful bundle method. The generalised Jacobian of a locally Lipschitz vector function\, as introduced by Clarke in mid 1970’s\, plays the same role in non-smooth vector (multi-objective) optimisation that the (Clarke) sub-gradient or sub-differential plays in the usual non-smooth scalar optimisation. The sub-gradient of a non-smooth objective function is a non-empty\, compact and convex subset of the finite Euclidean space of the same dimension as the domain of the objective function. Similarly\, the generalised Jacobian is a non-empty\, compact and convex subset of the space of real mxn matrices where n is the dimension of input and m is the dimension of the output of the multi-objective function. However\, until now\, there has been a huge discrepancy in the way they have been defined. The sub-gradient of a scalar function at a point was originally defined constructively by its support function which provides a simple expression for its boundary. In contrast\, the generalised Jacobian has been defined non-constructively by using a theorem of Rademacher in analysis which states that every Lipschitz map between finite dimensional Euclidean spaces is differentiable for almost all its arguments. The non-constructive nature of this definition has created a major obstacle in the application of the generalised Jacobian in vector optimisation and several other fields of computation such as non-smooth Newton method or solution of parametric ODE’s with non-smooth right hand side. There have been two attempts to tackle the problem of finding the support function of the generalised Jacobian. Hiriart-Urruty derived the support function of an approximation to the generalised Jacobian\, namely its so-called plenary hull. Imbert used a Green-Stokes formula to obtain an intractable analytic expression for the support function of the generalized Jacobian that involves a limsup operation over surface integrals of the divergence of the derived function on a shrinking sequence of hypercubes. In this talk\, I will derive a simple expression to compute the support function of the generalised Jacobian after 40 years. It determines the boundary of the non-empty compact convex set that the generalised Jacobian represents in the space of mxn matrices. The derivation is elementary\, does not invoke Rademacher’s theorem and is in the same spirit as that of the sub-gradient of a scalar objective function. Moreover\, I will show that the same technique can be used to compute the generalised Jacobian of locally Lipschitz multi-objective functions defined on an infinite dimensional Banach space\, which allows optimisation over function spaces. \nAbout the speaker. Abbas Edalat has been a professor of computer science and mathematics at the Department of Computing\, Imperial College London\, since 1997. URL:https://optimisation.doc.ic.ac.uk/event/seminar-solution-of-an-old-problem-in-vector-optimisation-support-function-of-the-generalised-jacobian/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20161107T143000 DTEND;TZID=UTC:20161107T143000 DTSTAMP:20260410T041543 CREATED:20170116T145746Z LAST-MODIFIED:20170116T145746Z UID:430-1478529000-1478529000@optimisation.doc.ic.ac.uk SUMMARY:Seminar: On Robust Selection Problems DESCRIPTION:Title: On Robust Selection Problems\nSpeaker: Marc Goerigk\nAffiliation: Department of Management Science – Lancaster University\nLocation: Room LT1 Business School\nTime: 2:30pm (1 hour) \nAbstract. Robust optimisation considers problems that are affected by uncertain data: How can we find a solution that performs well\, even if things don’t go quite as planned? Typically\, adding robustness to a problem makes it harder to solve. The selection problem is maybe the simplest non-trivial combinatorial optimisation problem. Given a set of n items\, the task is to choose p items that maximise some profit. Being that simple\, it is an interesting object of study for complexity in robust optimisation\, as its robust counterparts sometimes turn out to become NP-hard\, sometimes not. In this talk I present some of the complexity results in this area\, which can be surprising. Along the way\, we develop an overview on different approaches to robust optimisation\, and see what they mean for the selection problem. \nAbout the speaker. Marc Goerigk is a Lecturer in the Department of Management Science at Lancaster University. He studied mathematics and computer science at the University of Gottingen\, where he also completed his PhD in applied mathematics in 2012. From 2012 to 2015\, he worked as a Post-Doc at the University of Kaiserslautern. Besides robust optimisation\, his research interests include disaster management and public transportation problems. URL:https://optimisation.doc.ic.ac.uk/event/seminar-on-robust-selection-problems/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20161103T163000 DTEND;TZID=UTC:20161103T163000 DTSTAMP:20260410T041543 CREATED:20170116T150029Z LAST-MODIFIED:20170116T150029Z UID:434-1478190600-1478190600@optimisation.doc.ic.ac.uk SUMMARY:Seminar: On the Passage From Local to Global in Optimization - New Challenges in Theory and Practice DESCRIPTION:Title: On the Passage From Local to Global in Optimization – New Challenges in Theory and Practice\nSpeaker: Prof. Panos M. Pardalos\nAffiliation: Departments of Industrial and Systems and Biomedical Engineering – University of Florida\nLocation: Room 145 Huxley Building\nTime: 4:30pm (1 hour) \nAbstract. Large scale problems in the design of networks\, energy systems\, medicine and drug design\, in finance\, and engineering are modeled as optimization problems. Humans and nature are constantly optimizing to minimize costs or maximize profits\, to maximize the flow in a network\, or to minimize the probability of a blackout in the smart grid. Due to new algorithmic developments and the computational power of machines\, optimization algorithms have been used to solve problems in a wide spectrum of applications in science and engineering. In this talk we are going to address new challenges in the theory and practice of optimization. First\, we have to reflect back a few decades and see what has been achieved and then address the new research challenges and new directions. \nAbout the speaker. Panos Pardalos is a Distinguished Professor in the Departments of Industrial and Systems and Biomedical Engineering at the University of Florida\, and a world renowned leader in Global Optimization\, Mathematical Modeling\, and Data Sciences. He is currently a Fellow of AAAS\, AIMBE\, and INFORMS and was awarded the 2013 Constantin Caratheodory Prize of the International Society of Global Optimization. In addition\, Dr. Pardalos has been awarded the 2013 EURO Gold Medal prize bestowed by the Association for European Operational Research Societies. This medal is the preeminent European award given to Operations Research (OR) professionals for “scientific contributions that stand the test of time.” Prof. Pardalos is also an elected Member of the New York Academy of Sciences\, the Lithuanian Academy of Sciences\, the Royal Academy of Spain\, and the National Academy of Sciences of Ukraine. He is the Founding Editor of Optimization Letters\, Energy Systems\, and Co-Founder of the International Journal of Global Optimization. He has published over 500 papers\, edited/authored over 200 books and organized over 80 conferences. He has about 34\,000 citations on his work\, an H-index of 81\, an I10-index of 472 (Google Scholar) and has graduated 60 PhD students so far. URL:https://optimisation.doc.ic.ac.uk/event/seminar-on-the-passage-from-local-to-global-in-optimization-new-challenges-in-theory-and-practice/ END:VEVENT BEGIN:VEVENT DTSTART;TZID=UTC:20161025T140000 DTEND;TZID=UTC:20161025T170000 DTSTAMP:20260410T041543 CREATED:20170116T145907Z LAST-MODIFIED:20170116T145907Z UID:432-1477404000-1477414800@optimisation.doc.ic.ac.uk SUMMARY:Seminar: Optimisation with occasionally accurate data DESCRIPTION:Title: Optimisation with occasionally accurate data\nSpeaker: Coralia Cartis\nAffiliation: Mathematical Institute – Oxford and Balliol College\nLocation: Huxley building\nTime: 2:00pm (1 hour) \nAbstract. We present global rates of convergence for a general class of methods for nonconvex smooth optimization that include linesearch\, trust-region and regularisation strategies\, but that allow inaccurate problem information. Namely\, we assume the local (first- or second-order) models of our function are only sufficiently accurate with a certain probability\, and they can be arbitrarily poor otherwise. This framework subsumes certain stochastic gradient analyses and derivative-free techniques based on random sampling of function values. It can also be viewed as a robustness assessment of deterministic methods and their resilience to inaccurate derivative computation such as due to processor failure in a distribute framework. We show that in terms of the order of the accuracy\, the evaluation complexity of such methods is the same as their counterparts that use deterministic accurate models; the use of probabilistic models only increases the complexity by a constant\, which depends on the probability of the models being good. Time permitting\, we also discuss the case of inaccurate\, probabilistic function value information\, that arises in stochastic optimization. This work is joint with Katya Scheinberg (Lehigh University\, USA). \nAbout the speaker. Coralia Cartis (BSc Mathematics\, Babesh-Bolyai University\, Romania; PhD Mathematics\, University of Cambridge (2005)) has joined the Mathematical Institute at Oxford and Balliol College in 2013 as Associate Professor in Numerical Optimization. Previously\, she worked as a research scientist at Rutherford Appleton Laboratory and as a postdoctoral researcher at Oxford University. Between 2007-2013\, she was a (permanent) lecturer and senior lecturer in the School of Mathematics\, University of Edinburgh. Her research interests address the development\, analysis and implementation of algorithms for linear and nonlinear non-convex optimization problems\, suitable for large-scale problems. A particular focus of her recent research has been the complexity analysis/global rates of convergence of nonconvex optimization algorithms. Some of her methods have been included in GALAHAD optimization software library. She has also worked on applications of optimization in compressed sensing\, signal processing and for parameter estimation in climate modelling. URL:https://optimisation.doc.ic.ac.uk/event/seminar-optimisation-with-occasionally-accurate-data/ END:VEVENT END:VCALENDAR