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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Mathematical programming Ročník 159; číslo 1-2; s. 371 - 401
Hlavní autoři:	Li, Guoyin, Pong, Ting Kei
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer Berlin Heidelberg 01.09.2016 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!