Minimizing Sum of Truncated Convex Functions and Its Applications
From MaRDI portal
Publication:3391176
DOI10.1080/10618600.2017.1390471OpenAlexW2963705560MaRDI QIDQ3391176
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00236
Related Items (5)
Simultaneous feature selection and outlier detection with optimality guarantees ⋮ Solution methodologies for minimizing a sum of pointwise minima of two functions ⋮ Minimizing a sum of clipped convex functions ⋮ The continuous knapsack problem with capacities ⋮ A Framework of Learning Through Empirical Gain Maximization
Uses Software
Cites Work
- Regularization of case-specific parameters for robustness and efficiency
- High breakdown-point and high efficiency robust estimates for regression
- Penalized unsupervised learning with outliers
- Robust variable selection using least angle regression and elemental set sampling
- On a circle placement problem
- Lipschitzian optimization without the Lipschitz constant
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A penalized likelihood approach for robust estimation of isoform expression
- A class of robust and fully efficient regression estimators
- Translating a convex polygon to contain a maximum number of points.
- Introduction to nonlinear and global optimization
- Thresholding implied by truncated quadratic regularization
- Perspectives on Projective Geometry
- Outlier Detection Using Nonconvex Penalized Regression
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Efficient and Robust Image Restoration Using Multiple-Feature L2-Relaxed Sparse Analysis Priors
- Energy Minimization Methods
- Likelihood-Based Selection and Sharp Parameter Estimation
- Reducibility among Combinatorial Problems
- SPARSE AND ROBUST LINEAR REGRESSION: AN OPTIMIZATION ALGORITHM AND ITS STATISTICAL PROPERTIES
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- Robust Statistics
- The complexity of theorem-proving procedures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Minimizing Sum of Truncated Convex Functions and Its Applications