Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
DOI10.1007/s12190-019-01305-7zbMath1475.90114OpenAlexW2991495381WikidataQ126624376 ScholiaQ126624376MaRDI QIDQ2053310
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-019-01305-7
preconditionersupport vector machinescomplementarity problemline-searchnon-interior-point smoothing method
Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix-free interior point method
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- 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
- On preconditioner updates for sequences of saddle-point linear systems
- Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
- A primal-dual regularized interior-point method for convex quadratic programs
- 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
- A matrix-free smoothing algorithm for large-scale support vector machines
- A comparison of reduced and unreduced KKT systems arising from interior point methods
- A Smoothing Newton Method for Minimizing a Sum of Euclidean Norms
- Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
- Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
- Matrix Analysis
- 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
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- 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: Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
