A matrix-free smoothing algorithm for large-scale support vector machines
From MaRDI portal
Publication:2279568
DOI10.1016/J.INS.2016.04.010zbMATH Open1427.68271OpenAlexW2317424695MaRDI QIDQ2279568FDOQ2279568
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
Recommendations
- Smooth support vector machine based on Padé approximants
- SSVM: A smooth support vector machine for classification
- Smoothing function method for generalized support vector machine optimization problems
- New smoothing SVM algorithm with tight error bound and efficient reduced techniques
- An SMO Algorithm for the Potential Support Vector Machine
- SMO Algorithm for Least-Squares SVM Formulations
- Large-scale linear nonparallel support vector machine solver
- A Large Dimensional Analysis of Least Squares Support Vector Machines
Learning and adaptive systems in artificial intelligence (68T05) Iterative numerical methods for linear systems (65F10)
Cites Work
- SSVM: A smooth support vector machine for classification
- Support-vector networks
- Title not available (Why is that?)
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Numerical solution of saddle point problems
- Interior point methods 25 years later
- Interior-Point Methods for Massive Support Vector Machines
- Exploiting separability in large-scale linear support vector machine training
- A matrix-free trust-region SQP method for equality constrained optimization
- Title not available (Why is that?)
- Advances in large-margin classifiers
- A new analysis of block preconditioners for saddle point problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Smoothing algorithms for complementarity problems over symmetric cones
- Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
- Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
- Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP
- Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
- Title not available (Why is that?)
- Matrix-free interior point method for compressed sensing problems
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- A duality theorem for non-linear programming
- Matrix-free interior point method
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Semismooth support vector machines.
- A smoothing-type algorithm for solving system of inequalities
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Natural preconditioning and iterative methods for saddle point systems
- Title not available (Why is that?)
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections
- Preconditioning indefinite systems in interior point methods for optimization
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A smoothing Newton method for minimizing a sum of Euclidean norms
- A preconditioner for a primal-dual Newton conjugate gradient method for compressed sensing problems
Cited In (11)
- Discrete-time Euler-smoothing methods for time-varying convex constrained optimization
- \(\mathrm{L_1RIP}\)-based robust compressed sensing
- New preconditioners applied to linear programming and the compressive sensing problems
- A subspace elimination strategy for accelerating support matrix machine
- A sequential minimal optimization algorithm for solving Huber support vector regression with non-positive semi-definite kernels
- Using an iterative linear solver in an interior-point method for generating support vector machines
- A primal Douglas-Rachford splitting method for the constrained minimization problem in compressive sensing
- Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
- Support vector machine in big data: smoothing strategy and adaptive distributed inference
- Scalable Gaussian kernel support vector machines with sublinear training time complexity
- SSVM: A smooth support vector machine for classification
Uses Software
This page was built for publication: A matrix-free smoothing algorithm for large-scale support vector machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2279568)
