scientific article; zbMATH DE number 5957430

MaRDI QIDQ3174081zbMATH OpenFDO

Authors Nikolas List, Hans Ulrich Simon

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v8/list07a.html

zbMATH Keywords

support vector machinesdecomposition algorithmsconvex quadratic optimization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• Learning Theory
• Polynomial decompositions in polynomial time
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms
• Algorithms related to the decomposition of polynomials
• scientific article; zbMATH DE number 4101330
• scientific article; zbMATH DE number 4154575
• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• New algorithms for exact and approximate polynomial decomposition
• Algorithmic aspects of a general modular decomposition theory

Cited in

(8)

• On the complexity of working set selection
• Kernel methods in system identification, machine learning and function estimation: a survey
• Generalized SMO-Style Decomposition Algorithms
• Primal and dual predicted decrease approximation methods
• Radial kernels and their reproducing kernel Hilbert spaces
• Algorithmic Learning Theory
• QP algorithms with guaranteed accuracy and run time for support vector machines
• Learning Theory

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174081)