Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Peili, Xiao, Yunhai, Yang, Meixia, Zhu, Hanbing
Format:	Preprint
Published:	2021
Subjects:	Methodology Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Efficient Dual ADMM for Huber Regression with Fused Lasso Penalty
by: Shi, Mengjiao, et al.
Published: (2025)

Efficient Group Lasso Regularized Rank Regression with Data-Driven Parameter Determination
by: Lin, Meixia, et al.
Published: (2025)

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization
by: Deng, Zhanwang, et al.
Published: (2023)

ADMM-based Bilevel Descent Aggregation Algorithm for Sparse Hyperparameter Selection
by: Xiao, Yunhai, et al.
Published: (2026)

PNOD: An Efficient Projected Newton Framework for Exact Optimal Experimental Designs
by: Liang, Ling, et al.
Published: (2024)

Adaptive sieving with semismooth Newton proximal augmented Lagrangian algorithm for multi-task Lasso problems
by: Lin, Lanyu, et al.
Published: (2025)

Learning Interactions Between Continuous Treatments and Covariates with a Semiparametric Model
by: Jiang, Muyan, et al.
Published: (2025)

Graph-based Square-Root Estimation for Sparse Linear Regression
by: Li, Peili, et al.
Published: (2024)

A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
by: Wu, Yuqia, et al.
Published: (2025)

Sparse Quadratically Constrained Quadratic Programming via Semismooth Newton Method
by: Li, Shuai, et al.
Published: (2025)

Semismooth Newton Methods for Risk-Averse Markov Decision Processes
by: Gargiani, Matilde, et al.
Published: (2025)

A Primal Dual Active Set with Continuation Algorithm for $\ell_0$-Penalized High-dimensional Accelerated Failure Time Model
by: Li, Peili, et al.
Published: (2025)

Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates
by: Alphonse, Amal, et al.
Published: (2026)

LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates
by: Alphonse, Amal, et al.
Published: (2025)

A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport
by: Lin, Tianyi, et al.
Published: (2023)

Optimal Cross-Validation for Sparse Linear Regression
by: Cory-Wright, Ryan, et al.
Published: (2023)

Multiple Regression for Matrix and Vector Predictors: Models, Theory, Algorithms, and Beyond
by: Lin, Meixia, et al.
Published: (2024)

Changing the Kernel During Training Leads to Double Descent in Kernel Regression
by: Allerbo, Oskar
Published: (2023)

Fast Robust Kernel Regression through Sign Gradient Descent with Early Stopping
by: Allerbo, Oskar
Published: (2023)

The Stochastic Proximal Distance Algorithm
by: Jiang, Haoyu, et al.
Published: (2022)

Joint optimization for production operations considering reworking
by: Shen, Yilan, et al.
Published: (2024)

Distributed Online Economic Dispatch with Time-Varying Coupled Inequality Constraints
by: Zhou, Yingjie, et al.
Published: (2025)

Operational Dosage: Implications of Capacity Constraints for the Design and Interpretation of Experiments
by: Boutilier, Justin, et al.
Published: (2024)

Locally Adaptive Multi-Objective Learning
by: Kaur, Jivat Neet, et al.
Published: (2026)

On Regularization via Early Stopping for Least Squares Regression
by: Sonthalia, Rishi, et al.
Published: (2024)

Asymptotic Efficiency Analysis of the Recursive Least-Squares Algorithm for ARX Systems Without Projection
by: Liu, Xingrui, et al.
Published: (2025)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
by: Milzarek, Andre, et al.
Published: (2022)

Scalable Kernel Quantile Regression: A Preconditioned Augmented Lagrangian Method
by: Deng, Shengxiang, et al.
Published: (2025)

Experimenting under Stochastic Congestion
by: Li, Shuangning, et al.
Published: (2023)

From Contextual Data to Newsvendor Decisions: On the Actual Performance of Data-Driven Algorithms
by: Besbes, Omar, et al.
Published: (2023)

Improved $\ell_{p}$ Regression via Iteratively Reweighted Least Squares
by: Ene, Alina, et al.
Published: (2025)

Iteratively Reweighted Least Squares for Phase Unwrapping
by: Dubois-Taine, Benjamin, et al.
Published: (2024)

Distributionally robust halfspace depth
by: Ivanovs, Jevgenijs, et al.
Published: (2021)

Batch-based Bayesian Optimal Experimental Design in Linear Inverse Problems
by: Mäkinen, Sofia, et al.
Published: (2026)

Unmixing highly mixed grain size distribution data via maximum volume constrained end member analysis
by: Qi, Qianqian, et al.
Published: (2026)

Solving Minimax Problems with Bilinear Objectives with ADMM
by: Wilson, Bob
Published: (2026)

Toward Exact Convergence in Byzantine-Robust Decentralized Learning: A Statistical Identification Approach
by: Zhang, Siyuan, et al.
Published: (2026)

A Non-Gaussian Bayesian Filter Using Power and Generalized Logarithmic Moments
by: Wu, Guangyu, et al.
Published: (2022)

A Graph-Prediction-Based Approach for Debiasing Underreported Data
by: Jiang, Hanyang, et al.
Published: (2023)

The Monge optimal transport barycenter problem
by: Lipnick, Andrew D., et al.
Published: (2025)