scientific article; zbMATH DE number 7306909
From MaRDI portal
Publication:5149020
Defeng Sun, Kim-Chuan Toh, Peipei Tang, Cheng-Jing Wang
Publication date: 5 February 2021
Full work available at URL: https://arxiv.org/abs/1903.11460
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
An efficient semismooth Newton method for adaptive sparse signal recovery problems, A proximal dual semismooth Newton method for zero-norm penalized quantile regression estimator, Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems, Sparse precision matrix estimation with missing observations, A global two-stage algorithm for non-convex penalized high-dimensional linear regression problems, An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications, Robust Tensor Completion: Equivalent Surrogates, Error Bounds, and Algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearly unbiased variable selection under minimax concave penalty
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- DC approximation approaches for sparse optimization
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- An efficient inexact symmetric Gauss-Seidel based majorized ADMM for high-dimensional convex composite conic programming
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the exactness of a class of nondifferentiable penalty functions
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Improved bounds for square-root Lasso and square-root slope
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Adaptive estimation of a quadratic functional by model selection.
- Least angle regression. (With discussion)
- Slope meets Lasso: improved oracle bounds and optimality
- A nonsmooth version of Newton's method
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs
- Optimization with Sparsity-Inducing Penalties
- Computing B-Stationary Points of Nonsmooth DC Programs
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Scaled sparse linear regression
- Semismooth and Semiconvex Functions in Constrained Optimization
- Variational Analysis
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Composite Difference-Max Programs for Modern Statistical Estimation Problems
- The Convergence Guarantees of a Non-Convex Approach for Sparse Recovery
- A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems
- Sharp Oracle Inequalities for Square Root Regularization
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Robust Regression and Lasso
- The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms
- Difference-of-Convex Learning: Directional Stationarity, Optimality, and Sparsity
- Weakly decomposable regularization penalties and structured sparsity
- Convex Analysis
