A note on the support vector data description problem

DOI10.1016/J.ORL.2025.107357MaRDI QIDQ6890090zbMATH OpenFDO

Authors Amir Beck, Omer Noam

Publication date 4 December 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2025.107357

zbMATH Keywords

dual problemstrongly convex functionsupport vector data descriptionaccelerated dual method

Mathematics Subject Classification ID

Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41)

Cites work

• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A dual algorithm for the minimum covering ball problem in \(\mathbb R^n\)
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A proximal-based deomposition method for compositions method for convex minimization problems
• Algorithms - ESA 2003
• An algorithm for finding the Chebyshev center of a convex polyhedron
• First-order methods in optimization
• Introduction to Nonlinear Optimization: Theory, Algorithms, and Applications with Python and MATLAB, Second Edition
• Introduction to algorithms.
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
• Support vector data description

This page was built for publication: A note on the support vector data description problem

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