A Restricted Dual Peaceman-Rachford Splitting Method for QAP

  • Naomi Graham
  • Hao Hu
  • Xinxin Li
  • Henry Wolkowicz
  • Haesol Im
    • Categories (Mixed) Integer Nonlinear Programming, Linear, Cone and Semidefinite Programming, Optimization Software Benchmark Tags , , , , Short URL: https://optimization-online.org/?p=16481

    We revisit and strengthen splitting methods for solving doubly nonnegative, DNN, relaxations of the quadratic assignment problem, QAP. We use a modified restricted contractive splitting method, rPRSM, approach. Our strengthened bounds and new dual multiplier estimates improve on the bounds and convergence results in the literature.

    Citation

    Department of Combinatorics & Optimization, University of Waterloo, Canada,06/2019

    Article

    Download

    View A Restricted Dual Peaceman-Rachford Splitting Method for QAP