A note on Probably Certifiably Correct algorithms
Optimization and Control
2015-09-03 v1 Data Structures and Algorithms
Information Theory
math.IT
Abstract
Many optimization problems of interest are known to be intractable, and while there are often heuristics that are known to work on typical instances, it is usually not easy to determine a posteriori whether the optimal solution was found. In this short note, we discuss algorithms that not only solve the problem on typical instances, but also provide a posteriori certificates of optimality, probably certifiably correct (PCC) algorithms. As an illustrative example, we present a fast PCC algorithm for minimum bisection under the stochastic block model and briefly discuss other examples.
Cite
@article{arxiv.1509.00824,
title = {A note on Probably Certifiably Correct algorithms},
author = {Afonso S. Bandeira},
journal= {arXiv preprint arXiv:1509.00824},
year = {2015}
}