Preconditioned ADMM for a Class of Bilinear Programming Problems
Joint Authors
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-9, 9 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-01-10
Country of Publication
Egypt
No. of Pages
9
Main Subjects
Abstract EN
We design a novel preconditioned alternating direction method for solving a class of bilinear programming problems, where each subproblem is solved by adding a positive-definite regularization term with a proximal parameter.
By the aid of the variational inequality, the global convergence of the proposed method is analyzed and a worst-case O(1/t) convergence rate in an ergodic sense is established.
Several preliminary numerical examples, including the Markowitz portfolio optimization problem, are also tested to verify the performance of the proposed method.
American Psychological Association (APA)
Liang, Xiaobo& Bai, Jianchao. 2018. Preconditioned ADMM for a Class of Bilinear Programming Problems. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-9.
https://search.emarefa.net/detail/BIM-1208022
Modern Language Association (MLA)
Liang, Xiaobo& Bai, Jianchao. Preconditioned ADMM for a Class of Bilinear Programming Problems. Mathematical Problems in Engineering No. 2018 (2018), pp.1-9.
https://search.emarefa.net/detail/BIM-1208022
American Medical Association (AMA)
Liang, Xiaobo& Bai, Jianchao. Preconditioned ADMM for a Class of Bilinear Programming Problems. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-9.
https://search.emarefa.net/detail/BIM-1208022
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1208022