A second-order method for strongly convex ℓ1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy}…
By Kimon Fountoulakis, Jacek Gondzio. 2013
65 citations recorded by the source corpus.
In this paper a robust second-order method is developed for the solution of strongly convex ℓ1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _1$$\end{document}-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.
Subfields: Computational Mechanics, Mathematical Physics, Numerical Analysis
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Mechanics
- Amaya Nogales-Gómez
- Emilio Carrizosa
- Dolores Romero Morales
- Vanesa Guerrero
- Natasa Krejic
- Natasa Krklec Jerinkic
- Stefania Bellavia
- Laura Palagi
In Mathematical Physics
In Numerical Analysis
- Amaya Nogales-Gómez
- Vanesa Guerrero
- Natasa Krejic
- Natasa Krklec Jerinkic
- Dolores Romero Morales
- Emilio Carrizosa
- Stefania Bellavia
- Ioannis G. Tsoulos
Citations in the corpus
- Subsampled inexact Newton methods for minimizing large sums of convex functions (2018, methodology): “First we state a technical lemma from [15].”
- Clustering Categories in Support Vector Machines (2017, background): “The most popular strategy proposed in the literature to achieve this goal is feature selection [14, 15, 17, 35], which aims at selecting the subset of most relevant features for classification while maintaining or improving accuracy and preventing the risk of overfitting.”
- Visualizing data as objects by DC (difference of convex) optimization (2017, background): “In the Big Data era, Data Visualization is an area of interest to specialists from a wide variety of disciplines, [14, 15, 26, 27].”