A matrix-free smoothing algorithm for large-scale support vector machines

DOI10.1016/j.ins.2016.04.010zbMath1427.68271OpenAlexW2317424695MaRDI QIDQ2279568

Tie Ni, Jun Zhai

Publication date: 13 December 2019

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.04.010

zbMATH Keywords

preconditionersupport vector machinesnonmonotone line searchKKT systemssmoothing Newton algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Iterative numerical methods for linear systems (65F10)

Related Items

A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing ⋮ \(\mathrm{L_1RIP}\)-based robust compressed sensing ⋮ New preconditioners applied to linear programming and the compressive sensing problems ⋮ Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines ⋮ Scalable Gaussian kernel support vector machines with sublinear training time complexity

Uses Software

• SSVM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix-free interior point method
• Interior point methods 25 years later
• Exploiting separability in large-scale linear support vector machine training
• Semismooth support vector machines.
• Matrix-free interior point method for compressed sensing problems
• A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
• A smoothing-type algorithm for solving system of inequalities
• Smoothing algorithms for complementarity problems over symmetric cones
• A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
• Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
• Preconditioning indefinite systems in interior point methods for optimization
• Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
• Support-vector networks
• Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
• A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
• Natural Preconditioning and Iterative Methods for Saddle Point Systems
• A New Analysis of Block Preconditioners for Saddle Point Problems
• A Matrix-Free Trust-Region SQP Method for Equality Constrained Optimization
• Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
• A Non-Interior-Point Continuation Method for Linear Complementarity Problems
• Numerical solution of saddle point problems
• A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
• A duality theorem for non-linear programming
• Interior-Point Methods for Massive Support Vector Machines
• A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• Some Noninterior Continuation Methods for Linear Complementarity Problems
• Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
• Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
• SSVM: A smooth support vector machine for classification

This page was built for publication: A matrix-free smoothing algorithm for large-scale support vector machines