An Adaptive Linear Approximation Algorithm for Copositive Programs

We study linear optimization problems over the cone of copositive matrices. These problems appear in nonconvex quadratic and binary optimization; for instance, the maximum clique problem and other combinatorial problems can be reformulated as such problems. We present new polyhedral inner and outer...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	SIAM journal on optimization 2009-01, Vol.20 (1), p.30-53
Hauptverfasser:	Bundfuss, Stefan, Dür, Mirjam
Format:	Artikel
Sprache:	eng
Schlagworte:	Adaptive algorithms Algorithms Approximation Combinatorial analysis Mathematical analysis Mathematical models Matrices Optimization Optimization algorithms Quadratic programming Studies
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!