科研之友
微信
新浪微博
Facebook
分享链接
摘要
In this paper a robust second-order method is developed for the solution of strongly convex -regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently solved. The proposed approach is a primal-dual Newton conjugate gradients (pdNCG) method. Convergence properties of pdNCG are studied and worst-case iteration complexity is established. Numerical results are presented on synthetic sparse least-squares problems and real world machine learning problems.
- 出版日期2016-3
