Minimizing a sum of clipped convex functions
From MaRDI portal
Publication:2228412
DOI10.1007/s11590-020-01565-4zbMath1460.90129arXiv1910.12342OpenAlexW3013452933MaRDI QIDQ2228412
Publication date: 17 February 2021
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.12342
Convex programming (90C25) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
The ABC of DC programming ⋮ Simultaneous feature selection and outlier detection with optimality guarantees ⋮ Solution methodologies for minimizing a sum of pointwise minima of two functions ⋮ sccf
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- A perspective-based convex relaxation for switched-affine optimal control
- On the limited memory BFGS method for large scale optimization
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Robust regression: Asymptotics, conjectures and Monte Carlo
- An e-E-insensitive support vector regression machine
- Variations and extension of the convex-concave procedure
- Perspective reformulations of mixed integer nonlinear programs with indicator variables
- Learning sparse classifiers with difference of convex functions algorithms
- Perspective Reformulation and Applications
- Graph Implementations for Nonsmooth Convex Programs
- Outlier Detection Using Nonconvex Penalized Regression
- Minimizing Sum of Truncated Convex Functions and Its Applications
- Reducibility Among Combinatorial Problems
- The Concave-Convex Procedure
- Efficient and Robust Image Restoration Using Multiple-Feature L2-Relaxed Sparse Analysis Priors
- Convex Analysis
- Robust Statistics
