Box-Constrained Approach for Hard Permutation Problems

  • Published 2016


Algorithm 3 details the process for incrementally computing term (13) for all xk. (The process for computing (14) is similar.) Computation of the full gradient is thus also an O(nm) operation. Using this technique, we can apply full-gradient first-order methods efficiently, including gradient projection and Frank-Wolfe. With an appropriate line-search… (More)


4 Figures and Tables

Slides referencing similar topics