Douglas–Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems

We adapt the Douglas–Rachford (DR) splitting method to solve nonconvex feasibility problems by studying this method for a class of nonconvex optimization problem. While the convergence properties of the method for convex problems have been well studied, far less is known in the nonconvex setting. In...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Mathematical programming Jg. 159; H. 1-2; S. 371 - 401
Hauptverfasser:	Li, Guoyin, Pong, Ting Kei
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2016 Springer Nature B.V
Schlagworte:	Algebra Algorithms Applied mathematics Calculus of Variations and Optimal Control; Optimization Clusters Combinatorics Convergence Convex analysis Direct reduction Feasibility Full Length Paper Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematical models Mathematical programming Mathematics Mathematics and Statistics Mathematics of Computing Numerical Analysis Optimization Splitting Studies Theoretical Thresholds 90C06 90C90 90C26
ISSN:	0025-5610, 1436-4646
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!