Nuclear norm minimization for the planted clique and biclique problems

We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimization and then relax them using the nuclear norm. This technique, which may be regarded as a generalizatio...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming 2011-09, Vol.129 (1), p.69-89
Hauptverfasser:	Ames, Brendan P. W., Vavasis, Stephen A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bypasses Calculus of Variations and Optimal Control Optimization Combinatorics Convex analysis Data mining Exact solutions Full Length Paper Graphs Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Minimization Norms Numerical Analysis Optimization Studies Theoretical
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!