Optimized cutting plane algorithm for large-scale risk minimization
From MaRDI portal
Publication:2880969
Recommendations
- Stochastic Cutting Planes for Data-Driven Optimization
- Cut generation for optimization problems with multivariate risk constraints
- scientific article; zbMATH DE number 592648
- scientific article; zbMATH DE number 219017
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- A cutting plane method from analytic centers for stochastic programming
- scientific article; zbMATH DE number 2196287
- On global optimality conditions and cutting plane algorithms
- Cutting plane algorithms for robust conic convex optimization problems
Cited in
(10)- Privacy preserving feature selection and multiclass classification for horizontally distributed data
- Learning data discretization via convex optimization
- Cutting-plane training of structural SVMs
- Learning optimized risk scores
- Bundle methods for regularized risk minimization
- Nonlinear optimization and support vector machines
- A flexible elicitation procedure for additive model scale constants
- Nonlinear optimization and support vector machines
- Efficient optimization of \(F\)-measure with cost-sensitive SVM
- Stochastic Cutting Planes for Data-Driven Optimization
This page was built for publication: Optimized cutting plane algorithm for large-scale risk minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880969)