On the proximal Landweber Newton method for a class of nonsmooth convex problems.
Hai-Bin ZhangJiao-Jiao JiangYun-Bin ZhaoPublished in: Comput. Optim. Appl. (2015)
Keyphrases
- newton method
- globally convergent
- strictly convex
- variational inequalities
- convergence analysis
- linear svm
- convex functions
- optimality conditions
- quasi newton
- linear equations
- superlinear convergence
- regularized least squares
- mathematical programming
- online convex optimization
- quadratic programming
- optimization problems
- logistic regression
- global convergence
- semidefinite programming
- approximation algorithms
- kernel methods
- decision trees