An efficient support vector machine learning method with second-order cone programming for large-scale problems

DOI10.1007/S10489-005-4609-9MaRDI QIDQ2576752zbMATH OpenOpenAlexFDO

Authors Rameswar Debnath, Masakazu Muramatsu, Haruhisa Takahashi

Publication date 14 December 2005

Published in Applied Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10489-005-4609-9

zbMATH Keywords

quadratic programmingCholesky factorizationeigenvalue decompositionsupport vector machinesecond-order cone programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An efficient implementation of an active set method for SVMs
• Machine Learning: ECML 2004
• Maximum-gain working set selection for SVMs
• scientific article; zbMATH DE number 1974617
• Interior-Point Methods for Massive Support Vector Machines

Cites work

• scientific article; zbMATH DE number 3884831 (Why is no real title available?)
• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• 10.1162/15324430260185619
• A simple decomposition method for support vector machines
• An Interior-Point Method for Semidefinite Programming
• Downlink beamforming for DS-CDMA mobile radio with multimedia services
• Feasible direction decomposition algorithms for training support vector machines
• Improvements to Platt's SMO Algorithm for SVM Classifier Design
• Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
• LOQO:an interior point code for quadratic programming
• Learning the kernel matrix with semidefinite programming
• Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
• On a commutative class of search directions for linear programming over symmetric cones
• On implementing a primal-dual interior-point method for conic quadratic optimization
• On the Implementation of a Primal-Dual Interior Point Method
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• Primal--Dual Path-Following Algorithms for Semidefinite Programming
• SVMTorch: Support vector machines for large-scale regression problems.
• Training \(\nu\)-support vector classifiers: Theory and algorithms

Cited in

(17)

• Machine Learning: ECML 2004
• A smoothing Newton method for second-order cone optimization based on a new smoothing function
• A new smoothing Newton-type method for second-order cone programming problems
• A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
• Stochastic subgradient descent method for large-scale robust chance-constrained support vector machines
• Alternative second-order cone programming formulations for support vector classification
• Kernel projection algorithm for large-scale SVM problems.
• Mixed integer second-order cone programming formulations for variable selection in linear regression
• New constraint qualifications and optimality conditions for second order cone programs
• Feature scaling via second-order cone programming
• Evolution strategies based adaptive \(L_{p}\) LS-SVM
• FEATURE SELECTION VIA LEAST SQUARES SUPPORT FEATURE MACHINE
• A new one-step smoothing Newton method for second-order cone programming.
• Maximum-gain working set selection for SVMs
• Interior-Point Methods for Massive Support Vector Machines
• An efficient implementation of an active set method for SVMs
• Multi-class second-order cone programming support vector machines

Describes a project that uses

Uses Software

• SVMTorch
• LIBSVM
• UCI
• LOQO

This page was built for publication: An efficient support vector machine learning method with second-order cone programming for large-scale problems

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