Regularized Linear Programming Discriminant Rule with Folded Concave Penalty for Ultrahigh-Dimensional Data

DOI10.1080/10618600.2022.2143785MaRDI QIDQ6180737FDOQ6180737

Authors: Changcheng Li, Runze Li, Song-Shan Yang, Xiang Zhan 

Publication date: 22 January 2024

Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL: https://figshare.com/articles/journal_contribution/Regularized_Linear_Programming_Discriminant_Rule_with_Folded_Concave_Penalty_for_Ultrahigh-Dimensional_Data/21657762

zbMATH Keywords

ADMMfolded concave penaltyfeature-splitlinear programming discriminant

Mathematics Subject Classification ID

Statistics (62-XX)

Cites Work

• Nearly unbiased variable selection under minimax concave penalty
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
• One-step sparse estimates in nonconcave penalized likelihood models
• Distributed optimization and statistical learning via the alternating direction method of multipliers
• Title not available (Why is that?)
• High-dimensional classification using features annealed independence rules
• Some theory for Fisher's linear discriminant function, `naive Bayes', and some alternatives when there are many more variables than observations
• A direct estimation approach to sparse linear discriminant analysis
• Sparse linear discriminant analysis by thresholding for high dimensional data
• A constrained \(\ell _{1}\) minimization approach to sparse precision matrix estimation
• A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints
• Strong oracle optimality of folded concave penalized estimation
• Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates
• Folded concave penalized sparse linear regression: sparsity, statistical performance, and algorithmic theory for local solutions
• Communication-efficient sparse regression
• Communication-efficient algorithms for statistical optimization
• Statistical foundations of data science

Cited In (1)

• Nonconvex Dantzig selector and its parallel computing algorithm

This page was built for publication: Regularized Linear Programming Discriminant Rule with Folded Concave Penalty for Ultrahigh-Dimensional Data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180737)