Minimum Bipartite Matching via Riemann Optimization
2025-01-08
This paper presents a novel approach to solving the minimum bipartite matching problem using Riemann optimization. The author transforms the combinatorial optimization problem into an unconstrained optimization problem on the manifold of doubly stochastic matrices and solves it using Riemann gradient descent. Experimental results show that this method can effectively find the optimal solution and has good convergence. This research cleverly combines combinatorial mathematics, differential geometry, and computer science, providing a new perspective for solving such problems.