An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
From MaRDI portal
Publication:2046332
DOI10.1007/s10898-021-01054-7zbMath1475.90072OpenAlexW3191690675MaRDI QIDQ2046332
Publication date: 17 August 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01054-7
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coordinate descent algorithms for nonconvex penalized regression, with applications to biological feature selection
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Nearly unbiased variable selection under minimax concave penalty
- Sparse inverse covariance estimation with the graphical lasso
- Iterative reweighted minimization methods for \(l_p\) regularized unconstrained nonlinear programming
- High breakdown-point and high efficiency robust estimates for regression
- The solution path of the generalized lasso
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Redescending \(M\)-estimators
- One-step sparse estimates in nonconcave penalized likelihood models
- Asymptotic behavior of M-estimators for the linear model
- Global convergence of ADMM in nonconvex nonsmooth optimization
- Pathwise coordinate optimization for sparse learning: algorithm and theory
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- High-dimensional graphs and variable selection with the Lasso
- MOCCA: mirrored convex/concave optimization for nonconvex composite functions
- Proximal Splitting Methods in Signal Processing
- Supervised Feature Selection in Graphs with Path Coding Penalties and Network Flows
- On the Learning Behavior of Adaptive Networks—Part I: Transient Analysis
- SparseNet: Coordinate Descent With Nonconvex Penalties
- The Group Lasso for Logistic Regression
- Submonotone Subdifferentials of Lipschitz Functions
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- A Robust Journey in the New Millennium
- Multimodal Task-Driven Dictionary Learning for Image Classification
- Sparsity and Smoothness Via the Fused Lasso
- Proximal Decomposition Via Alternating Linearization
- Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning
- A Selective Linearization Method For Multiblock Convex Optimization
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- Robust Statistics
- Robust Estimation of a Location Parameter
- A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
This page was built for publication: An outer-inner linearization method for non-convex and nondifferentiable composite regularization problems
