Conditional minimum volume ellipsoid with application to multiclass discrimination
From MaRDI portal
(Redirected from Publication:732238)
Recommendations
Cites work
- scientific article; zbMATH DE number 3986407 (Why is no real title available?)
- scientific article; zbMATH DE number 194744 (Why is no real title available?)
- scientific article; zbMATH DE number 1836463 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 805067 (Why is no real title available?)
- An Algorithm for Separating Patterns by Ellipsoids
- Breast Cancer Diagnosis and Prognosis Via Linear Programming
- Clustering via minimum volume ellipsoids
- Computation of Minimum-Volume Covering Ellipsoids
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- On Numerical Solution of the Maximum Volume Ellipsoid Problem
- On the complexity of approximating the maximal inscribed ellipsoid for a polytope
- Optimal design: Some geometrical aspects of D-optimality
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
Cited in
(2)
This page was built for publication: Conditional minimum volume ellipsoid with application to multiclass discrimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732238)