Journées de l'optimisation 2016

HEC Montréal, Québec, Canada, 2 — 4 mai 2016

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

WA5 Optimization Software

4 mai 2016 10h30 – 12h10

Salle: Marie-Husny

Présidée par Dominique Orban

3 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    Implementation of a Python environment for derivative-free optimization

    • Dominique Orban, GERAD - Polytechnique Montréal
    • Dounia Lakhmiri, prés., GERAD

    We present and discuss the design of the Python environment for unconstrained derivative-free optimization. currently features several methods, including our implementation of UOBYQA and a simplified version of the Mesh-Adaptive Direct Search. The focus is on flexibility and the ability to customize the solution process.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    A workflow for designing optimization methods in the Julia language

    • Abel Siqueira, prés., Federal University of Paraná - Brazil
    • Dominique Orban, GERAD - Polytechnique Montréal

    In this presentation, we introduce a Julia interface to the CUTEst environment, and demonstrate its usage. We outline a workflow for implementing optimization methods, focusing on quickly creating a working implementation with automated testing, and then improving the code. We use the CUTEst interface for Julia through the development process.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    An Object-Oriented Environment for Large-Scale Optimization

    • Dominique Orban, GERAD - Polytechnique Montréal
    • Sylvain Arreckx, prés., GERAD - Polytechnique Montréal is a programming environment to model continuous optimization problems and to design computational methods in the high-level and powerful Python language with performance-critical parts implemented in Cython, a low-level superset of Python that compiles to machine code. is accompanied by an extensive set of building blocks to solve the linear algebra and subproblems typically encountered in the solution of large-scale convex and nonconvex problems, including direct and iterative method for linear systems, linesearch methods, trust-region subproblems, and bound-constrained subproblems. supports several sparse matrix packages, including our own novel Cysparse library. features turnkey algorithms for problems with specific structure along with tools to assess performance.
    The extensible nature of combines with the might and ubiquity of Python to make it a powerful development and analysis environment for optimization researchers and practitioners.