Nonconvex truncated conditional value at risk-based sparse linear regression
From MaRDI portal
Cites work
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A proximal-proximal majorization-minimization algorithm for nonconvex rank regression problems
- An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
- Clarke Subgradients of Stratifiable Functions
- Coherent measures of risk
- Constructing optimal sparse portfolios using regularization methods
- Convex Analysis
- Convex and Nonconvex Risk-Based Linear Regression at Scale
- DC algorithm for extended robust support vector machine
- DC approximation approaches for sparse optimization
- DC formulations and algorithms for sparse optimization problems
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- Maximum Properties and Inequalities for the Eigenvalues of Completely Continuous Operators
- Mean-CVaR portfolio selection: a nonparametric estimation framework
- Newsvendor Conditional Value-at-Risk Minimisation: a Feature-based Approach under Adaptive Data Selection
- Nonmonotone enhanced proximal DC algorithms for a class of structured nonsmooth DC programming
- On the Moreau-Yosida regularization of the vector k-norm related functions
- On the role of norm constraints in portfolio selection
- On the separation of estimation and control in risk-sensitive investment problems under incomplete observation
- Optimal pricing in on-demand-service-platform-operations with hired agents and risk-sensitive customers in the blockchain era
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Robust international portfolio optimization with worst-case mean-CVaR
- Robust Regression and Lasso
- Solving constrained nonsmooth group sparse optimization via group Capped-\(\ell_1\) relaxation and group smoothing proximal gradient algorithm
- Sparse and stable Markowitz portfolios
- Sparse least trimmed squares regression for analyzing high-dimensional large data sets
- Variable selection in convex quantile regression: \(\mathcal{L}_1\)-norm or \(\mathcal{L}_0\)-norm regularization?
- Variational Analysis
- Zero norm based analysis model for image smoothing and reconstruction
This page was built for publication: Nonconvex truncated conditional value at risk-based sparse linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6865584)
