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...

Although the Lagrangian method is a powerful dual search method in integer programming, it often fail to identify the optimal solution of the primal problem. In this paper, a quasi dual formulation is proposed for bounded integer programming. This formulation possesses an asymptotic strong...

In this paper, we design a new variable target value procedure, the trust region target value (TRTV) method, for optimizing nondifferentiable Lagrangian dual formulations of large-scale, ill-conditioned linear programming problems. Such problems typically arise in the context of Lagrangian...