Proximal Newton-Type Methods for Minimizing Composite Functions I: Proximal Quasi-Newton Methods Converge Q-Superlinearly under the Dennis–Moré CriterionResearch Paper
Many estimation problems in statistics, machine learning and signal processing minimize a composite function, the sum of a smooth loss and a convex but nonsmooth regularizer or constraint: the lasso and -regularized logistic regression, the graphical lasso for sparse inverse covariance estimation, and constrained least squares, where the nonsmooth…