Matrix Theory and Algorithms
Open access
Peer reviewed
Scollr summary
What this paper is about
This work proposes employing an NFFT-accelerated matrix–vector product using an ANOVA decomposition for the feature space and suggests a preconditioning approach that is based on low-rank approximations of the kernel matrix together with a Krylov subspace solver.
Full abstract
Read the full abstract
Abstract In this paper, we consider the numerical solution to the soft margin support vector machine optimization problem. This problem is typically solved using the SMO algorithm, given the high computational complexity of traditional optimization algorithms when dealing with large-scale kernel matrices. In this work, we propose employing an NFFT-accelerated matrix–vector product using an ANOVA decomposition for the feature space. Through this approach, an additive kernel design of trivariate sub-kernels is induced and the total number of used features can be reduced. This is used within an interior point method for the overall optimization problem. As this method requires the solution of a linear system of saddle point form we suggest a preconditioning approach that is based on low-rank approximations of the kernel matrix together with a Krylov subspace solver. We compare the accuracy of the ANOVA-based kernel with the default LIBSVM implementation. We investigate the performance of the different preconditioners as well as the accuracy of the ANOVA kernel on several large-scale data sets.
Direct answer
What can I do from this paper page?
Use this page to scan "A preconditioned interior point method for support vector machines using an ANOVA decomposition and NFFT-based matrix–vector products" quickly: start with the summary and abstract, then check the authors, source, topics, and related papers. From here, open Scollr to follow Matrix Theory and Algorithms research, save the paper, or map adjacent work.
Research areas
Follow related topics
Citation
BibTeX
@article{Wagner2026preconditioned,
title = {A preconditioned interior point method for support vector machines using an ANOVA decomposition and NFFT-based matrix–vector products},
author = {Theresa Wagner and John W. Pearson and Martin Stoll},
journal = {Mathematical Programming Computation},
year = {2026},
doi = {10.1007/s12532-026-00323-4},
url = {https://doi.org/10.1007/s12532-026-00323-4}
}FAQ
Using this paper in a discovery workflow
How do I find related work for this paper?
Use the related papers and topic links on this page as starting points. In Scollr, you can also open the paper and build a literature map around its references, citing papers, and related work.
How can I keep up with new Matrix Theory and Algorithms research papers?
Follow Matrix Theory and Algorithms research in Scollr. New papers from the topic flow into a personalized feed, and you can save useful studies to revisit later.
Can I cite this paper from this page?
This page includes a static BibTeX block for A preconditioned interior point method for support vector machines using an ANOVA decomposition and NFFT-based matrix–vector products. Always verify the DOI, source, and publication details against the publisher record before submitting a manuscript.
Follow this research in Scollr
Follow the topics and authors behind this paper, save useful studies, and build a literature map when you are ready to go deeper.
Get the app