We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints.
- Authors
Peng, Zheng; Chen, Jianli; Zhu, Wenxing
- Abstract
In this paper, a proximal alternating direction method of multipliers is proposed for solving a minimization problem with Lipschitz nonconvex constraints. Such problems are raised in many engineering fields, such as the analytical global placement of very large scale integrated circuit design. The proposed method is essentially a new application of the classical proximal alternating direction method of multipliers. We prove that, under some suitable conditions, any subsequence of the sequence generated by the proposed method globally converges to a Karush-Kuhn-Tucker point of the problem. We also present a practical implementation of the method using a certain self-adaptive rule of the proximal parameters. The proposed method is used as a global placement method in a placer of very large scale integrated circuit design. Preliminary numerical results indicate that, compared with some state-of-the-art global placement methods, the proposed method is applicable and efficient.
- Subjects
NONCONVEX programming; MULTIPLIERS (Mathematical analysis); LIPSCHITZ spaces; CONVEX domains; INTEGRATED circuit design; VERY large scale circuit integration
- Publication
Journal of Global Optimization, 2015, Vol 62, Issue 4, p711
- ISSN
0925-5001
- Publication type
Article
- DOI
10.1007/s10898-015-0287-2