A Convergence Proof for the Softassign Quadratic Assignment Algorithm
Abstract
The softassign quadratic assignment algorithm has recently emerged as an effective strategy for a variety of optimization prob(cid:173) lems in pattern recognition and combinatorial optimization. While the effectiveness of the algorithm was demonstrated in thousands of simulations, there was no known proof of convergence. Here, we provide a proof of convergence for the most general form of the algorithm.
Cite
Text
Rangarajan et al. "A Convergence Proof for the Softassign Quadratic Assignment Algorithm." Neural Information Processing Systems, 1996.Markdown
[Rangarajan et al. "A Convergence Proof for the Softassign Quadratic Assignment Algorithm." Neural Information Processing Systems, 1996.](https://mlanthology.org/neurips/1996/rangarajan1996neurips-convergence/)BibTeX
@inproceedings{rangarajan1996neurips-convergence,
title = {{A Convergence Proof for the Softassign Quadratic Assignment Algorithm}},
author = {Rangarajan, Anand and Yuille, Alan L. and Gold, Steven and Mjolsness, Eric},
booktitle = {Neural Information Processing Systems},
year = {1996},
pages = {620-626},
url = {https://mlanthology.org/neurips/1996/rangarajan1996neurips-convergence/}
}