RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
Di Hou, Tianyun Tang, Kim-Chuan Toh

TL;DR
RiNNAL+ introduces a Riemannian augmented Lagrangian approach with a hybrid phase strategy to efficiently solve large-scale DNN relaxations of mixed-binary quadratic programs, improving computational robustness.
Contribution
This work develops RiNNAL+, a novel Riemannian ALM method with a hybrid approach for solving DNN relaxations, reducing problem size and tuning requirements.
Findings
Efficiently solves large-scale DNN problems.
Outperforms existing methods in robustness and speed.
Reduces problem dimension from (n+l+1) to (n+1).
Abstract
Doubly nonnegative (DNN) relaxation usually provides a tight lower bound for a mixed-binary quadratic program (MBQP). However, solving DNN problems is challenging because: (1) the problem size is for an MBQP with variables and inequality constraints, and (2) the rank of optimal solutions cannot be estimated a priori due to the absence of theoretical bounds. In this work, we propose RiNNAL+, a Riemannian augmented Lagrangian method (ALM) for solving DNN problems. We prove that the DNN relaxation of an MBQP, with matrix dimension , is equivalent to the SDP-RLT relaxation (based on the reformulation-linearization technique) with a smaller matrix dimension . In addition, we develop a hybrid method that alternates between two phases to solve the ALM subproblems. In phase one, we apply low-rank matrix factorization and random perturbation to transform…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Stochastic Gradient Optimization Techniques · Matrix Theory and Algorithms
