A note on probably certifiably correct algorithms

Afonso Bandeira

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)329-333
Number of pages5
JournalComptes Rendus Mathematique
Volume354
Issue number3
DOIs
StatePublished - Mar 1 2016

Fingerprint

Bisection
Certificate
Optimality
Optimal Solution
Heuristics
Optimization Problem
Model

ASJC Scopus subject areas

  • Mathematics(all)

Cite this

A note on probably certifiably correct algorithms. / Bandeira, Afonso.

In: Comptes Rendus Mathematique, Vol. 354, No. 3, 01.03.2016, p. 329-333.

Research output: Contribution to journalArticle

Bandeira, Afonso. / A note on probably certifiably correct algorithms. In: Comptes Rendus Mathematique. 2016 ; Vol. 354, No. 3. pp. 329-333.
@article{27f7544098e04f92acce97d9cbc39540,
title = "A note on probably certifiably correct algorithms",
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.",
author = "Afonso Bandeira",
year = "2016",
month = "3",
day = "1",
doi = "10.1016/j.crma.2015.11.009",
language = "English (US)",
volume = "354",
pages = "329--333",
journal = "Comptes Rendus Mathematique",
issn = "1631-073X",
publisher = "Elsevier Masson",
number = "3",

}

TY - JOUR

T1 - A note on probably certifiably correct algorithms

AU - Bandeira, Afonso

PY - 2016/3/1

Y1 - 2016/3/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84958856593&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84958856593&partnerID=8YFLogxK

U2 - 10.1016/j.crma.2015.11.009

DO - 10.1016/j.crma.2015.11.009

M3 - Article

VL - 354

SP - 329

EP - 333

JO - Comptes Rendus Mathematique

JF - Comptes Rendus Mathematique

SN - 1631-073X

IS - 3

ER -