Minimizing Sum of Truncated Convex Functions and Its Applications
From MaRDI portal
Cites work
- A class of robust and fully efficient regression estimators
- A penalized likelihood approach for robust estimation of isoform expression
- Efficient and Robust Image Restoration Using Multiple-Feature L2-Relaxed Sparse Analysis Priors
- Energy minimization methods
- Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
- High breakdown-point and high efficiency robust estimates for regression
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- scientific article; zbMATH DE number 2201408 (Why is no real title available?)
- Introduction to nonlinear and global optimization
- Likelihood-based selection and sharp parameter estimation
- Lipschitzian optimization without the Lipschitz constant
- On a circle placement problem
- Outlier detection using nonconvex penalized regression
- Penalized unsupervised learning with outliers
- Perspectives on projective geometry. A guided tour through real and complex geometry
- Reducibility among combinatorial problems
- Regularization of case-specific parameters for robustness and efficiency
- Robust Statistics
- Robust variable selection using least angle regression and elemental set sampling
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- SPARSE AND ROBUST LINEAR REGRESSION: AN OPTIMIZATION ALGORITHM AND ITS STATISTICAL PROPERTIES
- The complexity of theorem-proving procedures
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Thresholding implied by truncated quadratic regularization
- Translating a convex polygon to contain a maximum number of points.
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(5)- The continuous knapsack problem with capacities
- Minimizing a sum of clipped convex functions
- Solution methodologies for minimizing a sum of pointwise minima of two functions
- A Framework of Learning Through Empirical Gain Maximization
- Simultaneous feature selection and outlier detection with optimality guarantees
This page was built for publication: Minimizing Sum of Truncated Convex Functions and Its Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391176)
