科研之友
微信
新浪微博
Facebook
分享链接
摘要
Estimators are often defined as the solutions to data dependent optimization problems. A common form of objective function to be optimized) that arises in statistical estimation is the sum of a convex function V and a quadratic complexity penalty. A standard paradigm for creating kernel-based estimators leads to such an optimization problem. This article describes an optimization algorithm designed for unconstrained optimization problems in which the objective function is the sum of a non negative convex function and a known quadratic penalty. The algorithm is described and compared with BFGS on some penalized logistic regression and penalized L3/2 regression problems.
- 出版日期2011
