A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints

DOI10.1007/s10898-015-0287-2zbMath1330.90088OpenAlexW2000051597MaRDI QIDQ496623

Zheng Peng, Jian-Li Chen, Wen-Xing Zhu

Publication date: 22 September 2015

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-015-0287-2

zbMATH Keywords

global convergencenonconvex minimizationVLSIalternating direction method of multipliersproximal point method

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items

Global optimization for non-convex programs via convex proximal point method, The alternating direction method of multipliers for finding the distance between ellipsoids

Uses Software

• mPL6
• NTUplace3
• Capo
• Fastplace

Cites Work

• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• An improved proximal alternating direction method for monotone variational inequalities with separable structure
• Extra-proximal methods for solving two-person nonzero-sum games
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Proximal point methods and nonconvex optimization
• A new inexact alternating directions method for monotone variational inequalities
• Gradient approach of computing fixed points of equilibrium problems
• Seven kinds of monotone maps
• Proximal alternating directions method for structured variational inequalities
• A Proximal Point Algorithm for Log-Determinant Optimization with Group Lasso Regularization
• Matrix completion via an alternating direction method
• Monotone Operators and the Proximal Point Algorithm
• Partial Proximal Minimization Algorithms for Convex Pprogramming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item