A strictly contractive Peaceman-Rachford splitting method with logarithmic-quadratic proximal regularization for convex programming
Year of publication: |
2015
|
---|---|
Authors: | Li, Min ; Yuan, Xiaoming |
Published in: |
Mathematics of operations research. - Catonsville, MD : INFORMS, ISSN 0364-765X, ZDB-ID 195683-8. - Vol. 40.2015, 4, p. 842-858
|
Subject: | convex programming | Peaceman-Rachford splitting method | logarithmic-quadratic proximal regularization | convergence rate | iteration complexity | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
He, Bingsheng, (2017)
-
Quasi-convex feasibility problems : subgradient methods and convergence rates
Hu, Yaohua, (2022)
-
Jiang, Yaning, (2022)
- More ...
-
He, Bingsheng, (2017)
-
Primal-dual hybrid gradient method for distributionally robust optimization problems
Liu, Yongchao, (2017)
-
A Barzilai-Borwein-based heuristic algorithm for locating multiple facilities with regional demand
Jiang, Jianlin, (2012)
- More ...