Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms

Haoran Sun University of Minnesota Mingyi Hong University of Minnesota

Optimization and Control Machine Learning mathscidoc:2004.27017

IEEE Transactions on Signal Processing, 67, (22), 5912-5928, 2019.9
No abstract uploaded!
Non-convex distributed optimization, Optimal convergence rate, Lower complexity bound
[ Download ] [ 2020-04-27 13:17:09 uploaded by sunhr ] [ 337 downloads ] [ 0 comments ]
@inproceedings{haoran2019distributed,
  title={Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms},
  author={Haoran Sun, and Mingyi Hong},
  url={http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20200427131709366482658},
  booktitle={IEEE Transactions on Signal Processing},
  volume={67},
  number={22},
  pages={5912-5928},
  year={2019},
}
Haoran Sun, and Mingyi Hong. Distributed Non-Convex First-Order Optimization and Information Processing: Lower Complexity Bounds and Rate Optimal Algorithms. 2019. Vol. 67. In IEEE Transactions on Signal Processing. pp.5912-5928. http://archive.ymsc.tsinghua.edu.cn/pacm_paperurl/20200427131709366482658.
Please log in for comment!
 
 
Contact us: office-iccm@tsinghua.edu.cn | Copyright Reserved