A convergence proof for the softassign quadratic assignment algorithm

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 620-626

  Rangarajan, Anand ^a   Yuille, Alan ^b   Gold, Steven ^c   Mjolsness, Eric ^d  

^a YALE UNIVERSITY SCHOOL OF MEDICINE   (United States)

^b SMITH KETTLEWELL EYE RESEARCH INSTITUTE   (United States)

^c CURAGEN CORPORATION   (United States)

^d UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PATTERN RECOGNITION;

OPTIMIZATION PROBLEMS; QUADRATIC ASSIGNMENT; SOFTASSIGN;

ALGORITHMS;

EID: 0012546233     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388,1996.
2. S. Gold and A. Rangarajan. Softassign versus softmax: Benchmarks in combinatorial optimization. In Advances in Neural Information Processing Systems 8, pages 626-632. MIT Press, 1996.
3. E. Mjolsness and C. Garrett. Algebraic transformations of objective functions. Neural Networks, 3:651-669, 1990.
4. A. Rangarajan, S. Gold, and E. Mjolsness. A novel optimizing network architecture with applications. Neural Computation, 8(5): 1041-1060,1996.
5. A. L. Yuille and J. J. Kosowsky. Statistical physics algorithms that converge. Neural Computation, 6(3):341-356, May 1994.