Robust formulations for clustering-based large-scale classification

DOI10.1007/s11081-011-9166-yzbMath1294.62141OpenAlexW2031400413MaRDI QIDQ402195

Jagarlapudi Saketha Nath, Aharon Ben-Tal, Chiranjib Bhattacharyya

Publication date: 27 August 2014

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-011-9166-y

zbMATH Keywords

robustnessconfidence setsChebyshev inequalitylarge dataset classificationSOCP

Mathematics Subject Classification ID

Related Items (1)

Variation-aware clock network buffer sizing using robust multi-objective optimization

Uses Software

• SeDuMi

Cites Work

• Chance constrained uncertain classification via robust optimization
• Robust optimization-methodology and applications
• Robust Convex Optimization
• On Safe Tractable Approximations of Chance-Constrained Linear Matrix Inequalities
• An Active Set Method for Single-Cone Second-Order Cone Programs
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• 10.1162/153244303321897726
• Training a Support Vector Machine in the Primal
• Multivariate Chebyshev Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust formulations for clustering-based large-scale classification