Variations and extension of the convex–concave procedure

We investigate the convex–concave procedure, a local heuristic that utilizes the tools of convex optimization to find local optima of difference of convex (DC) programming problems. The class of DC problems includes many difficult problems such as the traveling salesman problem. We extend the standa...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Optimization and engineering 2016-06, Vol.17 (2), p.263-287
Hauptverfasser:	Lipp, Thomas, Boyd, Stephen
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computational geometry Control Convexity Engineering Environmental Management Feasibility Financial Engineering Inequalities Mathematical analysis Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Programming Systems Theory Traveling salesman problem Vectors (mathematics)
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!