We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Peaceman-Rachford splitting for a class of nonconvex optimization problems.
- Authors
Li, Guoyin; Liu, Tianxiang; Pong, Ting
- 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.
- Subjects
NONCONVEX programming; MATHEMATICAL optimization; LIPSCHITZ spaces; NUMERICAL analysis; LEAST squares
- Publication
Computational Optimization & Applications, 2017, Vol 68, Issue 2, p407
- ISSN
0926-6003
- Publication type
Article
- DOI
10.1007/s10589-017-9915-8