Robust multicategory support matrix machines
DOI10.1007/S10107-019-01386-ZzbMATH Open1415.90080OpenAlexW2932520883WikidataQ92952489 ScholiaQ92952489MaRDI QIDQ2425180FDOQ2425180
Sheng Fu, Yufeng Liu, Chengde Qian, Changliang Zou, Quoc Tran Dinh
Publication date: 26 June 2019
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc6980461
nonconvex optimizationrobustnessFisher consistencyangle-based classifiersDCA (difference of convex function) algorithmspectral elastic net
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Convex programming (90C25) Nonconvex programming, global optimization (90C26)
Cites Work
- Title not available (Why is that?)
- The elements of statistical learning. Data mining, inference, and prediction
- Support-vector networks
- Regularization and Variable Selection Via the Elastic Net
- Introductory lectures on convex optimization. A basic course.
- On the \(O(1/n)\) convergence rate of the Douglas-Rachford alternating direction method
- A Singular Value Thresholding Algorithm for Matrix Completion
- Robust Truncated Hinge Loss Support Vector Machines
- Multicategory Support Vector Machines
- Robust Statistics
- Multicategory angle-based large-margin classification
- Regularized Matrix Regression
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Convex Analysis
- Some estimates of norms of random matrices
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
- Coordinate descent algorithms
- Foundations of machine learning
- Convex analysis and monotone operator theory in Hilbert spaces
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- On the ergodic convergence rates of a first-order primal-dual algorithm
- Proximal alternating penalty algorithms for nonsmooth constrained convex optimization
- Faster Convergence Rates of Relaxed Peaceman-Rachford and ADMM Under Regularity Assumptions
- Multiple rank multi-linear SVM for matrix data classification
- Robust multicategory support vector machines using difference convex algorithm
- Assessing robustness of classification using an angular breakdown point
Cited In (1)
This page was built for publication: Robust multicategory support matrix machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2425180)