Proximal Newton-type methods for convex optimization
| 
88 | 
49 | 
0
Abstract
where g is convex and continuously differentiable and 
is a convex but not necessarily differentiable function whose proximal mapping can be evaluated efficiently. We derive a generalization of Newton-type methods to handle such convex but nonsmooth objective functions. We prove such methods are globally convergent and achieve superlinear rates of convergence in the vicinity of an optimal solution. We also demonstrate the performance of these methods using problems of relevance in machine learning and statistics.
还没有评论，说两句吧！
热门资源
The Variational S...
Unlike traditional images which do not offer in...
Learning to Predi...
Much of model-based reinforcement learning invo...
Stratified Strate...
In this paper we introduce Stratified Strategy ...
Learning to learn...
The move from hand-designed features to learned...
A Mathematical Mo...
Direct democracy, where each voter casts one vo...
智能在线
400-630-6780
聆听.建议反馈
E-mail: support@tusaishared.com
资源分类
