Reviews: (Probably) Concave Graph Matching

Update: I have considered the author response. Some of my previous questions have been answered. I have updated my review and "overall score". This paper focuses on graph matching problems with quadratic objective functions. These objectives are usually equivalent to a quadratic assignment problem (QAP) [1] on the permutation matrix space. The authors focused on the Frank-Wolfe algorithm (Algorithm 1) on the objectives with the relaxation from the permutation matrix space to the doubly stochastic matrix space DS.