Nonlinear optimization and support vector machines

DOI10.1007/s10288-018-0378-2zbMath1398.65126OpenAlexW2804008190MaRDI QIDQ5915690

Veronica Piccialli, Marco Sciandrone

Publication date: 3 August 2018

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2158/1139008

zbMATH Keywords

convex quadratic programmingstatistical learning theorysupport vector machinekernel functionsnonlinear optimization methodsWolfe's dual theory

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)

Related Items

Mathematical optimization in classification and regression trees, Global optimization issues in deep network regression: an overview, Distributed algorithms for convex problems with linear coupling constraints, Improving P300 speller performance by means of optimization and machine learning, Margin optimal classification trees, Unnamed Item, Nonlinear optimization and support vector machines, 4OR comes of age. Editorial note, A study on sequential minimal optimization methods for standard quadratic problems

Uses Software

• TRON
• GPDT
• LIBLINEAR
• Pegasos
• bmrm
• SSVM
• PRMLT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supervised classification and mathematical optimization
• Exploiting separability in large-scale linear support vector machine training
• Using an iterative linear solver in an interior-point method for generating support vector machines
• Pegasos: primal estimated sub-gradient solver for SVM
• Semismooth support vector machines.
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds
• Lagrangian relaxation for SVM feature selection
• Support-vector networks
• Sparse kernel SVMs via cutting-plane training
• Cutting-plane training of structural SVMs
• An incremental least squares algorithm for large scale linear classification
• Support vector machine polyhedral separability in semisupervised learning
• Breakpoint searching algorithms for the continuous quadratic knapsack problem
• A convergent decomposition algorithm for support vector machines
• New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
• Formulations of Support Vector Machines: A Note from an Optimization Point of View
• On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning
• 10.1162/15324430260185619
• Numerically stable LDLT factorizations in interior point methods for convex quadratic programming
• 10.1162/15324430152748218
• A finite newton method for classification
• Interior-Point Methods for Massive Support Vector Machines
• Newton's Method for Large Bound-Constrained Optimization Problems
• Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
• Training a Support Vector Machine in the Primal
• On the convergence of a modified version of SVM^lightalgorithm
• A Correspondence Between Bayesian Estimation on Stochastic Processes and Smoothing by Splines
• On the working set selection in gradient projection-based decomposition techniques for support vector machines
• Multicategory proximal support vector machine classifiers
• SSVM: A smooth support vector machine for classification
• A simple decomposition method for support vector machines
• Convergence of a generalized SMO algorithm for SVM classifier design