Abstract
Based on a novel reformulation of the feasible region, we propose and analyze a partial Lagrangian relaxation approach for the unbalanced orthogonal Procrustes problem (UOP). With a properly selected Lagrangian multiplier, the Lagrangian relaxation (LR) is equivalent to the recent matrix lifting semidefinite programming relaxation (MSDR), which has much more variables and constraints. Numerical results show that (LR) is solved more efficiently than (MSDR). Moreover, based on the special structure of (LR), we successfully employ the well-known Frank–Wolfe algorithm to efficiently solve very large instances of (LR). The rate of the convergence is shown to be independent of the row-dimension of the matrix variable of (UOP). Finally, motivated by (LR), we propose a Lagrangian heuristic for (UOP). Numerical results show that it can efficiently find the global optimal solutions of some randomly generated instances of (UOP).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have