Fast Approximate Quadratic Programming for Large (Brain) Graph Matching

• Published in: arXiv.org
• Main Authors: Vogelstein, Joshua T, Conroy, John M, Lyzinski, Vince, Podrazik, Louis J, Kratzer, Steven G, Harley, Eric T, Fishkind, Donniell E, R Jacob Vogelstein, Priebe, Carey E
• Format: Paper
• Language: English
• Published: Ithaca Cornell University Library, arXiv.org 13.09.2014
• Subjects: Algorithms; Apexes; Brain; Computer vision; Data management; Domains; Graph matching; Graph theory; Graphs; Operations research; Optimization; Quadratic programming

Quadratic assignment problems (QAPs) arise in a wide variety of domains, ranging from operations research to graph theory to computer vision to neuroscience. In the age of big data, graph valued data is becoming more prominent, and with it, a desire to run algorithms on ever larger graphs. Because Q...