An Efficient Algorithm for Minimizing Multi Non-Smooth Component Functions

DOI10.1080/10618600.2020.1804390OpenAlexW3046958375MaRDI QIDQ5066427

No author found.

Publication date: 29 March 2022

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

Full work available at URL: https://doi.org/10.1080/10618600.2020.1804390

zbMATH Keywords

nonsmooth optimizationregularizationpenalized regression

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• Spatial Statistics
• Yall1

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• Smoothing proximal gradient method for general structured sparse regression
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• Theoretical properties of the overlapping groups Lasso
• Proximal average approximated incremental gradient descent for composite penalty regularized empirical risk minimization
• Incremental Subgradient Methods for Nondifferentiable Optimization
• A Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
• Proximal Decomposition Via Alternating Linearization
• A Selective Linearization Method For Multiblock Convex Optimization
• The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
• Parallel Proximal Algorithm for Image Restoration Using Hybrid Regularization
• Model Selection and Estimation in Regression with Grouped Variables