DOCSLIB.ORG

Offline and Online Optimization in Machine Learning

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Offline and Online Optimization in Machine Learning Offline and Online Optimization in Machine Learning Peter Sunehag ANU September 2010 Section Introduction: Optimization with gradient methods Introduction:Machine Learning and Optimization Convex Analysis (Sub)Gradient Methods Online (sub)Gradient Methods Steepest decent I We want to find the minimum of a real valued function n f : R ! R. I We will primarily discuss optimization using gradients I Gradient Decent is also called the steepest decent method Problem: Curvature I If we the level sets are very curved (far from round), gradient decent might take a long route to the optimum I Newton's method takes curvature into account and "corrects" for it. It relies on calculating inverse Hessian (second derivatives) of the objective function I Quasi-Newton methods estimates the "correction" by looking at the path so far. Red Newton, Green Gradient Decent Problem: Zig-Zag I Gradient Descent has a tendency to Zig-Zag I This is particularly problematic in valleys I One solution: Introduce momentum I Another solution: Conjugate gradients Section Introduction: Optimization with gradient methods Introduction:Machine Learning and Optimization Convex Analysis (Sub)Gradient Methods Online (sub)Gradient Methods Optimization in Machine Learning I Data is becoming "unlimited" in many areas. I Computational resources are not I Taking advantage of the data requires efficient optimization I Machine Learning researchers have realized that we are in a different situation compared to the contexts in which the optimization (say convex optimization) field developed. I Some of those methods and theories are still useful. I Different ultimate goal. I We optimize surrogates for what we really want. I We also often have much higher dimensionality than other applications. Optimization in Machine Learning I Known training data A, unknown test data B I We want optimal performance on the test data I Alternatively we have streaming data (or pretend that we do). I Given a loss function L(w; z) (parameters w 2 W , data P sample(s) z), we want as low loss z2B L(z; w) as possible on the test set. I Since we do not have access to the test set, we minimize regularized empirical loss on the training set X L(z; w) + λR(w): z2A I Getting extremely close to the minimum of this objective might not increase performance on the test set. I In Machine learning, the optimization methods of interest are ∗ those that fast get a good estimate wk to the optimum w Optimization in Machine Learning ∗ I How large k to get k = f (wk ) − f (w ) ≤ for a given > 0? 2 p 1 I Is this number like 1/, 1/ ; 1= , log ? 2 I Is k like 1=k; 1=k , etc I How long does an iteration take? I Quasi-Newton methods (BFGS, L-BFGS), are rapid when we are already close to the optimum but otherise not better than methods (gradient decent) with much cheaper iterations. I We care the most about the early phase when we are not close to the optimum Examples T I linear classifier (classes ±1) f (x) = sgn(w x + b). I Training data f(xi ; yi )g I SVMs (hinge loss), P T 2 minw i min(0; 1 − yi (w xi + b)) + λkwk2 exp w T x P yi i 2 I Logistic multi-class: minw i log P T + λkwk2 l exp wl xi ∗ T I Decision l = argmaxl fwl xg I Different regularizers, e.g. kxk1 encourages sparsity. I hinge loss and `1 regularization causes non-differentiability on null sets. Section Introduction: Optimization with gradient methods Introduction:Machine Learning and Optimization Convex Analysis (Sub)Gradient Methods Online (sub)Gradient Methods Gradients I We will make use of gradients with respect to a given coordinate system and its associated Euclidean geometry. I If f (x) is a real valued function that is differentiable at x = (x1; :::; xd ), then @f @f rx f = ( ; :::; ) @x1 @xd I The gradient points in the direction of steepest ascent Subgradients d I If f (x) is a convex real valued function, and if g 2 R is such that f (x) − f (y) ≥ g T (x − y) for all y in some open ball around x, then g is in the subgradient set of f at x. I If f is differentiable, then only rf (x) is in the subgradient set. I A line with slope g can be drawn that only meet f at x Convex set n I A set X ⊂ R is convex if for all x; y 2 X and 0 ≤ λ ≤ 1, (1 − λ)x + λy 2 X Convex function n n I A function f : R ! R is convex if 8λ 2 [0; 1] and x; y 2 R , f ((1 − λ)x + λy) ≤ (1 − λ)f (x) + λf (y): I The set above the function's curve is called its epigraph I A function is convex iff its epigraph isa convex set I A convex function is called closed if the epigraph is closed Strong Convexity n I A function f : R ! R is ρ-strongly convex (ρ > 0) if n 8λ 2 [0; 1] and x; y 2 R , λ(1 − λ) f ((1 − λ)x + λy) ≤ (1 − λ)f (x) + λf (y) − ρ kx − yk2 2 2 2 I or equivalently if f (x) − (ρ/2)kxk2 is convex I or equivalently 2 f (y) ≥ f (x)+ < rf (x); y − x > +(ρ/2)kx − yk2 2 I or equivalently (if twice diff) r f (x) ≥ ρI (id matrix) 4 2 I Green (y = x ) is too flat. Blue (y = x ) is not too flat. Lipschitz Continuity I f is L-Lipschitz if jf (x) − f (y)j ≤ Lkx − yk2 I Lipschitz implies continuity but not differentiability I If differentiable, then bounded (norm) gradients implies Lipschitz continuity. I The secant slopes are bounded by L Lipschitz Continuous Gradients I If f is differentiable, then having L-Lipschitz gradients (L-LipG) means that krf (x) − rf (y)k2 ≤ Lkx − yk2 which is equivalent to L f (y) ≤ f (x)+ < rf (x); y − x > + kx − yk2 2 2 which if f is twice differentiable is equivalent to r2f (x) ≤ L · I . Legendre transform I Transformation between points and lines (set of tangents) I One dimensional functions (generalizes to Fenchel transform) ∗ I f (p) = maxx (px − f (x)). I If f differentiable, the maximizing x has the property that f 0(x) = p. Fenchel duality I The fenchel dual of a function f is f ∗(s) = sup < s; x > −f (x) x ∗∗ I If f is a closed convex function, then f = f . ∗ I f (0) = maxx (−f (x)) = − minx f (x) I rf ∗(s) = argmax < s; x > −f (x): x rf (x) = argmax < s; x > −f ∗(s): s ∗ ∗ I rf (rf (x)) = x and rf (rf (s)) = s Duality between strong convexity and Lipschitz gradients ∗ 1 I f is ρ strongly convex iff f has ρ -Lip. gradients ∗ ∗ 1 I f has L-Lip. gradients iff f is L strongly convex ∗ I If a non-differentiable funtion f can be identified as g we can 2 ∗ "smooth it out" by considering( g + δk · k2) which is 1 differentiable and has δ -Lip gradients. µ I δ = 2 below Section Introduction: Optimization with gradient methods Introduction:Machine Learning and Optimization Convex Analysis (Sub)Gradient Methods Online (sub)Gradient Methods (Sub)Gradient Methods I Gradient descent: wt+1 = wt − at gt , gt (sub)gradient of objective f at wt . I at can be decided by line search or by a predetermined scheme I If we are constrained to a convex set X , then use wt+1 = ΠX (wt − at gt ) = argmin kw − (wt − at gt )k2 w2X First and Second order information I First order information: rf (wt ); t = 0; 1; 2; :::; n 2 I Second order information is about r f and is expensive to compute and store for high dimensional problems. I Newton's method is a second order method where −1 wt+1 = wt − (Ht ) gt . I Quasi-Newton methods use first order information to try to approximate Newton's method. I Conjugate gradient also use first order information Lower Bounds I There are lower bounds for how well a first order method, i.e. a method for which wk+1 − wk 2Span(rf (x0); :::; rf (xk )) can do. They depend on the function class! I Given w0 ( and L, ρ), the bound is saying that for any > 0 there exists f in the class such that it takes at least n steps for any first order method and a statement about n is made. I Differentiable functions with Lipschitz continuous gradients: q 1 Lower bound is O( ) I Lipschitz continuous gradients and strong convexity: Lower 1 bound is O(log ). Gradient Descent with Lipschitz gradients I If we have L-Lipschitz continuous gradients, then define gradient decent by 1 w = w − rf (w ): k+1 k L k I Monotone: f (wk+1) ≤ f (wk ). I If f is also ρ-strongly convex (ρ > 0), then ρ (f (w ) − f (w ∗)) ≤ (1 − )k (f (w ) − f (w ∗)): k L 0 1 I This result translates into the optimal O(log ) rate for first order methods Gradient Descent without strong convexity I Suppose that we do not have strong convexity (ρ = 0) but we have L-LipG. 1 I Then the gradient descent procedure wk+1 = wk − L rf (wk ) 1 ∗ L ∗ 2 has rate O( ).(f (wk ) − f (w )) ≤ k kw − w0k . q 1 I The lower bound for this class is O( ). I There is a gap! I The question arose if the bound was loose or if there is a better first order method Nesterov's methods I Nesterov answered the question in 1983 by constructing an q 1 "Optimal Gradient Method" with the rate O( ) q L (O( ) if we have not fixed L).
Load more

Recommended publications
  • Y Nesterov Introductory Lecture Notes on Convex Optimization
    Y Nesterov Introductory Lecture Notes On Convex Optimization Jean-Luc filter his minsters discrown thermochemically or undeservingly after Haskel moralised and etymologised terrestrially, thixotropic and ravaging. Funded Artur monopolizes, his screwings mars outboxes sixfold. Maynard is endways: she slave imperiously and planning her underpainting. To provide you signed in this paper we have described as such formulations is a different methodology than the lecture notes on convex optimization nesterov ebook, and prox function minimization in the mapping is based methods 10112015 First part led the lecture notes is available 29102015. Interior gradient ascent algorithms and difficult to note that achieves regret? Comprehensive Exam Syllabus for Continuous Optimization. Convex Optimization for rigorous Science. Register update notification mail Add to favorite lecture list Academic. Nesterov 2003 Introductory Lectures on Convex Optimization Springer. The flow polytope corresponds to note that arise in this. Lecture Notes IE 521 Convex Optimization Niao He. The most important properties of our methods were provided with inequality. Optimization UCLA Computer Science. This is in order information gathered in parallel. CVXPY A Python-Embedded Modeling Language for Convex. The random decision. The assumption that use of an efficient algorithms we note that ogd as well understood and not present can update method clarified on optimization, we assume that learns as labelled data. Introduction to Online Convex Optimization by Elad Hazan Foundations and. Yurii Nesterov Google Cendekia Google Scholar. 3 First order algorithms for online convex optimization 39. Nisheeth K Vishnoi Theoretical Computer Science EPFL. Convergence rates trust-region methods introduction to the AMPL modeling language. Introductory Lectures on Convex Optimization A Basic Course.
    [Show full text]
  • Prizes and Awards Session
    PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes ....................................................................................................................
    [Show full text]
  • Iteration Parallel Algorithm for Optimal Transport
    A Direct O~(1/) Iteration Parallel Algorithm for Optimal Transport Arun Jambulapati, Aaron Sidford, and Kevin Tian Stanford University fjmblpati,sidford,[email protected] Abstract Optimal transportation, or computing the Wasserstein or “earth mover’s” distance between two n-dimensional distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves the problem to additive accuracy with O~(1/) parallel depth and O~ n2/ work. [BJKS18, Qua19] obtained this runtime through reductions to positive linear pro- gramming and matrix scaling. However, these reduction-based algorithms use subroutines which may be impractical due to requiring solvers for second-order iterations (matrix scaling) or non-parallelizability (positive LP). Our methods match the previous-best work bounds by [BJKS18, Qua19] while either improv- ing parallelization or removing the need for linear system solves, and improve upon the previous best first-order methods running in time O~(min(n2/2; n2:5/)) [DGK18, LHJ19]. We obtain our results by a primal-dual extragradient method, motivated by recent theoretical improvements to maximum flow [She17]. 1 Introduction Optimal transport is playing an increasingly important role as a subroutine in tasks arising in machine learning [ACB17], computer vision [BvdPPH11, SdGP+15], robust optimization [EK18, BK17], and statistics [PZ16]. Given these applications for large scale learning, design- ing algorithms for efficiently approximately solving the problem has been the
    [Show full text]
  • Arxiv:1411.2129V1 [Math.OC]
    INTERIOR-POINT ALGORITHMS FOR CONVEX OPTIMIZATION BASED ON PRIMAL-DUAL METRICS TOR MYKLEBUST, LEVENT TUNC¸EL Abstract. We propose and analyse primal-dual interior-point algorithms for convex opti- mization problems in conic form. The families of algorithms we analyse are so-called short- step algorithms and they match the current best iteration complexity bounds for primal-dual symmetric interior-point algorithm of Nesterov and Todd, for symmetric cone programming problems with given self-scaled barriers. Our results apply to any self-concordant barrier for any convex cone. We also prove that certain specializations of our algorithms to hyperbolic cone programming problems (which lie strictly between symmetric cone programming and gen- eral convex optimization problems in terms of generality) can take advantage of the favourable special structure of hyperbolic barriers. We make new connections to Riemannian geometry, integrals over operator spaces, Gaussian quadrature, and strengthen the connection of our algorithms to quasi-Newton updates and hence first-order methods in general. arXiv:1411.2129v1 [math.OC] 8 Nov 2014 Date: November 7, 2014. Key words and phrases. primal-dual interior-point methods, convex optimization, variable metric methods, local metric, self-concordant barriers, Hessian metric, polynomial-time complexity; AMS subject classification (MSC): 90C51, 90C22, 90C25, 90C60, 90C05, 65Y20, 52A41, 49M37, 90C30. Tor Myklebust: Department of Combinatorics and Optimization, Faculty of Mathematics, University of Wa- terloo, Waterloo, Ontario N2L 3G1, Canada (e-mail: [email protected]). Research of this author was supported in part by an NSERC Doctoral Scholarship, ONR Research Grant N00014-12-10049, and a Dis- covery Grant from NSERC.
    [Show full text]
  • A Primal-Dual Interior-Point Algorithm for Nonsymmetric Exponential-Cone Optimization
    A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization Joachim Dahl Erling D. Andersen May 27, 2019 Abstract A new primal-dual interior-point algorithm applicable to nonsymmetric conic optimization is proposed. It is a generalization of the famous algorithm suggested by Nesterov and Todd for the symmetric conic case, and uses primal-dual scalings for nonsymmetric cones proposed by Tun¸cel.We specialize Tun¸cel'sprimal-dual scalings for the important case of 3 dimensional exponential-cones, resulting in a practical algorithm with good numerical performance, on level with standard symmetric cone (e.g., quadratic cone) algorithms. A significant contribution of the paper is a novel higher-order search direction, similar in spirit to a Mehrotra corrector for symmetric cone algorithms. To a large extent, the efficiency of our proposed algorithm can be attributed to this new corrector. 1 Introduction In 1984 Karmarkar [11] presented an interior-point algorithm for linear optimization with polynomial complexity. This triggered the interior-point revolution which gave rise to a vast amount research on interior-point methods. A particularly important result was the analysis of so-called self-concordant barrier functions, which led to polynomial-time algorithms for linear optimization over a convex domain with self-concordant barrier, provided that the barrier function can be evaluated in polynomial time. This was proved by Nesterov and Nemirovski [18], and as a consequence convex optimization problems with such barriers can be solved efficently by interior-point methods, at least in theory. However, numerical studies for linear optimization quickly demonstrated that primal-dual interior- point methods were superior in practice, which led researchers to generalize the primal-dual algorithm to general smooth convex problems.
    [Show full text]
  • Acta Numerica on Firstorder Algorithms for L 1/Nuclear Norm
    Acta Numerica http://journals.cambridge.org/ANU Additional services for Acta Numerica: Email alerts: Click here Subscriptions: Click here Commercial reprints: Click here Terms of use : Click here On first­order algorithms for l 1/nuclear norm minimization Yurii Nesterov and Arkadi Nemirovski Acta Numerica / Volume 22 / May 2013, pp 509 ­ 575 DOI: 10.1017/S096249291300007X, Published online: 02 April 2013 Link to this article: http://journals.cambridge.org/abstract_S096249291300007X How to cite this article: Yurii Nesterov and Arkadi Nemirovski (2013). On first­order algorithms for l 1/nuclear norm minimization. Acta Numerica, 22, pp 509­575 doi:10.1017/S096249291300007X Request Permissions : Click here Downloaded from http://journals.cambridge.org/ANU, IP address: 130.207.93.116 on 30 Apr 2013 Acta Numerica (2013), pp. 509–575 c Cambridge University Press, 2013 doi:10.1017/S096249291300007X Printed in the United Kingdom On first-order algorithms for 1/nuclear norm minimization Yurii Nesterov∗ Center for Operations Research and Econometrics, 34 voie du Roman Pays, 1348, Louvain-la-Neuve, Belgium E-mail: [email protected] Arkadi Nemirovski† School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332, USA E-mail: [email protected] In the past decade, problems related to l1/nuclear norm minimization have attracted much attention in the signal processing, machine learning and opti- mization communities. In this paper, devoted to 1/nuclear norm minimiza- tion as ‘optimization beasts’, we give a detailed description of two attractive first-order optimization techniques for solving problems of this type. The first one, aimed primarily at lasso-type problems, comprises fast gradient meth- ods applied to composite minimization formulations.
    [Show full text]
  • Universal Intermediate Gradient Method for Convex Problems with Inexact Oracle
    Universal Intermediate Gradient Method for Convex Problems with Inexact Oracle Dmitry Kamzolov a Pavel Dvurechenskyb and Alexander Gasnikova,c. aMoscow Institute of Physics and Technology, Moscow, Russia; b Weierstrass Institute for Applied Analysis and Stochastics, Berlin, Germany; cInstitute for Information Transmission Problems RAS, Moscow, Russia. October 22, 2019 Abstract In this paper, we propose new first-order methods for minimization of a convex function on a simple convex set. We assume that the objective function is a composite function given as a sum of a simple convex function and a convex function with inexact H¨older-continuous subgradient. We propose Universal Intermediate Gradient Method. Our method enjoys both the universality and intermediateness properties. Following the ideas of Y. Nesterov (Math.Program. 152: 381-404, 2015) on Universal Gradient Methods, our method does not require any information about the H¨olderparameter and constant and adjusts itself automatically to the local level of smoothness. On the other hand, in the spirit of the Intermediate Gradient Method proposed by O. Devolder, F.Glineur and Y. Nesterov (CORE Discussion Paper 2013/17, 2013), our method is intermediate in the sense that it interpolates between Universal Gradient Method and Universal Fast Gradient Method. This allows to balance the rate of convergence of the method and rate of the oracle error accumulation. Under additional assumption of strong convexity of the objective, we show how the restart technique can be used to obtain an algorithm with faster rate of convergence. 1 Introduction arXiv:1712.06036v2 [math.OC] 21 Oct 2019 In this paper, we consider first-order methods for minimization of a convex function over a simple convex set.
    [Show full text]
  • 68 OP14 Abstracts
    68 OP14 Abstracts IP1 of polyhedra. Universal Gradient Methods Francisco Santos In Convex Optimization, numerical schemes are always University of Cantabria developed for some specific problem classes. One of the [email protected] most important characteristics of such classes is the level of smoothness of the objective function. Methods for nons- IP4 mooth functions are different from the methods for smooth ones. However, very often the level of smoothness of the Combinatorial Optimization for National Security objective is difficult to estimate in advance. In this talk Applications we present algorithms which adjust their behavior in ac- cordance to the actual level of smoothness observed during National-security optimization problems emphasize safety, the minimization process. Their only input parameter is cost, and compliance, frequently with some twist. They the required accuracy of the solution. We discuss also the may merit parallelization, have to run on small, weak plat- abilities of these schemes in reconstructing the dual solu- forms, or have unusual constraints or objectives. We de- tions. scribe several recent such applications. We summarize a massively-parallel branch-and-bound implementation for a Yurii Nesterov core task in machine classification. A challenging spam- CORE classification problem scales perfectly to over 6000 pro- Universite catholique de Louvain cessors. We discuss math programming for benchmark- [email protected] ing practical wireless-sensor-management heuristics. We sketch theoretically justified algorithms for a scheduling problem motivated by nuclear weapons inspections. Time IP2 permitting, we will present open problems. For exam- ple, can modern nonlinear solvers benchmark a simple lin- Optimizing and Coordinating Healthcare Networks earization heuristic for placing imperfect sensors in a mu- and Markets nicipal water network? Healthcare systems pose a range of major access, quality Cynthia Phillips and cost challenges in the U.S.
    [Show full text]
  • Yurii Nesterov
    The Department of Statistics & Operations Research The University of North Carolina-Chapel Hill HOTELLING LECTURES The Hotelling Lectures are an annual event in the Department of Statistics & Operations Research at the University of North Carolina - Chapel Hill, honoring the memory of Professor Harold Hotelling our first chairman. This year we are honored to have Hotelling Lectures Professor Yurii Nesterov presented by from the Catholic University of Louvain deliver our two Yurii Nesterov Hotelling lectures which Center for Operations Research and are open to the public. Econometrics (CORE) Catholic University of Louvain (UCL), Belgium Hunting for Invisible Hands Monday, April 8th, 2019 3:30-4:30pm 120 Hanes Hall Reception following the lecture 4:30-5:30pm in the 3rd Floor lounge of Hanes Hall Soft clustering by convex electoral model Wednesday, April 10th, 2019 3:30-4:30pm 120 Hanes Hall Reception prior to the lecture 3:00-3:30pm in the 3rd Floor lounge of Hanes Hall Abstracts Hunting for Invisible Hands Monday, April 8th, 2019 In this talk, we discuss several optimization algorithms deeply incorporated in our daily life. In accordance to the standard Microeconomic Theory, we are surrounded by many invisible hands (Adam Smith, 1776), which are responsible for keeping the balanced production and ensuring the rationality of consumers. The main goal of this talk is to make some of these hands visible. We show that they correspond to several efficient optimization algorithms with provable efficiency bounds. Moreover, all computations required for their implementation are performed on subconscious level, which make them applicable even in the Wild Nature.
    [Show full text]
  • Low-Rank Semidefinite Programming: Theory And
    Full text available at: http://dx.doi.org/10.1561/2400000009 Low-Rank Semidefinite Programming: Theory and Applications Alex Lemon Stanford University [email protected] Anthony Man-Cho The Chinese University of Hong Kong [email protected] Yinyu Ye Stanford University [email protected] Boston — Delft Full text available at: http://dx.doi.org/10.1561/2400000009 R Foundations and Trends in Optimization Published, sold and distributed by: now Publishers Inc. PO Box 1024 Hanover, MA 02339 United States Tel. +1-781-985-4510 www.nowpublishers.com [email protected] Outside North America: now Publishers Inc. PO Box 179 2600 AD Delft The Netherlands Tel. +31-6-51115274 The preferred citation for this publication is A. Lemon, A. M.-C. So, Y. Ye. Low-Rank Semidefinite Programming: Theory and Applications. Foundations and Trends R in Optimization, vol. 2, no. 1-2, pp. 1–156, 2015. R This Foundations and Trends issue was typeset in LATEX using a class file designed by Neal Parikh. Printed on acid-free paper. ISBN: 978-1-68083-137-5 c 2016 A. Lemon, A. M.-C. So, Y. Ye All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, mechanical, photocopying, recording or otherwise, without prior written permission of the publishers. Photocopying. In the USA: This journal is registered at the Copyright Clearance Cen- ter, Inc., 222 Rosewood Drive, Danvers, MA 01923. Authorization to photocopy items for internal or personal use, or the internal or personal use of specific clients, is granted by now Publishers Inc for users registered with the Copyright Clearance Center (CCC).
    [Show full text]
  • Newsletter 18 of EUROPT
    Newsletter 18 of EUROPT EUROPT - The Continuous Optimization Working Group of EURO http://www.iam.metu.edu.tr/EUROPT/ January 2010 1 In this issue: ² Words from the chair ² Forthcoming Events ² Awards and Nominations ² Job opportunities ² Invited Short Note: "Simple bounds for boolean quadratic problems", by Yu. Nesterov ² Editor’s personal comments 2 Words from the chair Dear Members of EUROPT, dear Friends, It is once again my great pleasure to insert some salutation words in this new issue of our Newsletter. In these special days, I would like to express to all of you my best wishes for a Happy New Year 2010, and my deep thanks to the Members of the Managing Board (MB) for their permanent support and expert advice. This is also time for remembering the many important scientific events to take place during this year. They are of great interest, and I am sure of meeting most of you in some of them. I would like to express my gratitude to those members of EUROPT who are involved in the organization of these activities and, according the experience of the last years, all of them will be successfully organized. I would like to start by calling your attention on our 8th EUROPT Workshop "Advances in Continuous Optimization" (www.europt2010.com), to be held in University of Aveiro, Portugal, in July 9-10, the days previous to EURO XXIV 2010, in Lisbon (http://euro2010lisbon.org/). We kindly invite you to participate in this meeting, which is the annual meeting of our EU- ROPT group and that, in this occasion, has many additional points of interest.
    [Show full text]
  • Conference Book
    Download the latest version of this book at https://iccopt2019.berlin/conference_book Conference Book Conference Book — Version 1.0 Sixth International Conference on Continuous Optimization Berlin, Germany, August 5–8, 2019 Michael Hintermuller¨ (Chair of the Organizing Committee) Weierstrass Institute for Applied Analysis and Stochastics (WIAS) Mohrenstraße 39, 10117 Berlin c July 16, 2019, WIAS, Berlin Layout: Rafael Arndt, Olivier Huber, Caroline L¨obhard, Steven-Marian Stengl Print: FLYERALARM GmbH Picture Credits page 19, Michael Ulbrich: Sebastian Garreis page 26, “MS Mark Brandenburg”: Stern und Kreisschiffahrt GmbH ICCOPT 2019 Sixth International Conference on Continuous Optimization Berlin, Germany, August 5–8, 2019 Program Committee Welcome Address Michael Hintermuller¨ (Weierstrass Institute Berlin, On behalf of the ICCOPT 2019 Humboldt-Universit¨at zu Berlin, Chair) Organizing Committee, the Weier- strass Institute for Applied Analysis H´el`ene Frankowska (Sorbonne Universit´e) and Stochastics Berlin, the Technis- Jacek Gondzio (The University of Edinburgh) che Universit¨at Berlin, and the Math- ematical Optimization Society, I wel- Zhi-Quan Luo (The Chinese University of Hong Kong) come you to ICCOPT 2019, the 6th International Conference on Continu- Jong-Shi Pang (University of Southern California) ous Optimization. Daniel Ralph (University of Cambridge) The ICCOPT is a flagship conference of the Mathematical Optimization Society. Organized every three years, it covers all Claudia Sagastiz´abal (University of Campinas) theoretical, computational, and practical aspects of continuous Defeng Sun (Hong Kong Polytechnic University) optimization. With about 150 invited and contributed sessions and twelve invited state-of-the-art lectures, totaling about 800 Marc Teboulle (Tel Aviv University) presentations, this is by far the largest ICCOPT so far.
    [Show full text]