Journées de l'optimisation 2018

HEC Montréal, Québec, Canada, 7 — 9 mai 2018

Horaire Auteurs Mon horaire
Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402

MA7 Conic optimization and applications

7 mai 2018 10h30 – 12h10

Salle: Groupe Cholette (35)

Présidée par Miguel F. Anjos

3 présentations

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h30 - 10h55

    Two stage architecture optimization for differentially private Kalman filtering

    • Kwassi Holali Degue, prés., Ecole Polytechnique de Montreal
    • Jérôme Le Ny, GERAD - Polytechnique Montréal

    The problem of Kalman filtering under privacy constraints is addressed. This problem occurs in scenarios where a data aggregator aims at releasing publicly, in real-time, a combination of privacy-sensitive signals that originate from a linear Gaussian model. An optimum differentially private mechanism that is computed using semidefinite programming is proposed.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    10h55 - 11h20

    Improving the linear relaxation of maximum k-cut with semidefinite-based constraints

    • Vilmar Jefte Rodrigues De Sousa, prés., Polytechnique Montréal
    • Miguel F. Anjos, GERAD, Polytechnique Montréal
    • Sebastien Le Digabel, Polytechnique Montréal

    We consider the maximum k-cut problem that consists in partitioning the vertex set of a graph into k subsets such that the sum of the weights of edges joining vertices in different subsets is maximized. The associated semidefinite programming (SDP) relaxation is known to give strong bounds but it suffers from high CPU times. We deploy a cutting plane algorithm that exploits the early termination of an interior-point method, and we study the performance of SDP and linear programming (LP) relaxations for a variety of values of k and of types of instances. The LP relaxation is strengthened using combinatorial facet-defining inequalities as well as SDP-based constraints. Our computational results suggest that the LP approach, especially with the addition of SDP-based constraints, outperforms the SDP relaxations for graphs with positive weights edges and k larger or equal to 7.

  • Cal add eabad1550a3cf3ed9646c36511a21a854fcb401e3247c61aefa77286b00fe402
    11h20 - 11h45

    Bounding procedure improvements for BiqCrunch, a semidefinite-based solver for binary quadratic optimization

    • Nathan Krislock, prés., Northern Illinois University
    • Ahmed Al-Jilawi, Northern Illinois University

    BiqCrunch is a branch-and-bound solver using semidefinite optimization to compute high-quality bounds for combinatorial optimization problems that can be modeled as binary quadratic problems, such as MaxCut, Max-k-Cluster, Maximum-Independent-Set, Exact Quadratic Knapsack, and the Quadratic Assignment Problem. BiqCrunch does not use an interior-point method for computing its bounds. Instead, an eigenvalue solver and a gradient-based method are used to compute tight bounds. We will discuss new improvements to the bounding procedure of BiqCrunch.

Retour