Semismooth Newton Augmented Lagrangian Algorithm for Adaptive Lasso Penalized Least Squares in Semiparametric Regression

11/21/2021
by   Meixia Yang, et al.
0

This paper is concerned with a partially linear semiparametric regression model with an unknown regression coefficient, an unknown nonparametric function for the non-linear component, and an unobservable Gaussian distributed random error. We consider the applications of the least squares to semiparametric regression and particularly present an adaptive lasso penalized least squares (PLS) procedure to select the regression coefficient. Different from almost all the numerical methods in previous literature, this paper concentrates on the corresponding dual problem. We observe that the dual problem consists of a smooth strongly convex function and an indicator function, so it can be solved by the semismooth Newton augmented Lagrangian (SSNAL) algorithm. Besides, a strongly semismooth nonlinear system is involved per-iteration, which can be solved by the semismooth Newton by taking full use of the structure of proximal mappings. We show that this implemented algorithm offers a notable computational advantage in statistical regression inference and the sequence generated by the method admits fast local convergence rate under some assumptions. Numerical experiments on some simulation data and real data are conducted, and the performance comparisons with ADMM to demonstrate the effectiveness of PLS and the progressiveness of SSNAL are also included.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/27/2021

A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems

Square-root Lasso problems are proven robust regression problems. Furthe...
research
11/05/2019

Penalized least squares and sign constraints with modified Newton-Raphson algorithms: application to EEG source imaging

We propose a modified Newton-Raphson (MNR) algorithm to estimate multipl...
research
08/22/2018

Efficient sparse Hessian based algorithms for the clustered lasso problem

We focus on solving the clustered lasso problem, which is a least square...
research
02/26/2020

Efficient algorithms for multivariate shape-constrained convex regression problems

Shape-constrained convex regression problem deals with fitting a convex ...
research
01/19/2021

A doubly relaxed minimal-norm Gauss-Newton method for nonlinear least-squares

When a physical system is modeled by a nonlinear function, the unknown p...
research
02/10/2019

Optimal Penalized Function-on-Function Regression under a Reproducing Kernel Hilbert Space Framework

Many scientific studies collect data where the response and predictor va...
research
05/12/2023

Extended ADMM for general penalized quantile regression with linear constraints in big data

Quantile regression (QR) can be used to describe the comprehensive relat...

Please sign up or login with your details

Forgot password? Click here to reset