Please use this identifier to cite or link to this item:
Title: Peaceman-Rachford splitting for a class of nonconvex optimization problems
Authors: Li, GY
Liu, TX 
Pong, TK 
Keywords: Peaceman-Rachford splitting
Feasibility problems
Nonconvex optimization problems
Global convergence
Issue Date: 2017
Publisher: Springer
Source: Computational optimization and applications, 2017, v. 68, no. 2, p. 407-436 How to cite?
Journal: Computational optimization and applications 
Abstract: We study the applicability of the Peaceman-Rachford (PR) splitting method for solving nonconvex optimization problems. When applied to minimizing the sum of a strongly convex Lipschitz differentiable function and a proper closed function, we show that if the strongly convex function has a large enough strong convexity modulus and the step-size parameter is chosen below a threshold that is computable, then any cluster point of the sequence generated, if exists, will give a stationary point of the optimization problem. We also give sufficient conditions guaranteeing boundedness of the sequence generated. We then discuss one way to split the objective so that the proposed method can be suitably applied to solving optimization problems with a coercive objective that is the sum of a (not necessarily strongly) convex Lipschitz differentiable function and a proper closed function; this setting covers a large class of nonconvex feasibility problems and constrained least squares problems. Finally, we illustrate the proposed algorithm numerically.
ISSN: 0926-6003
EISSN: 1573-2894
DOI: 10.1007/s10589-017-9915-8
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of May 11, 2018


Last Week
Last month
Citations as of May 20, 2018

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.