LAUSR

Graph matching problem has been widely used in many fields. Due to the discrete property of graph matching problem, the continuous relaxation will result in a bad influence on the solution. Thus, we propose a hypergraph matching model with an entropy barrier function considering the discrete property of the assignment matrix. The model is solved by a nonmonotone active set projected Newton method whose nonmonotone line search technique has a good ability to accept the projected Newton stepsize. We evaluate our method through several experiments, which indicates that our method has better matching results than others.