Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
type: Item
instance of: scholarly article
title: Non-interior-point smoothing Newton method for CP revisited and its application to support vector machines
zbMATH Open document ID: 1475.90114
author: Tie Ni
published in: Journal of Applied Mathematics and Computing
publication date: 2021-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 7435279
zbMATH Keywords: non-interior-point smoothing method
zbMATH Keywords: complementarity problem
zbMATH Keywords: preconditioner
zbMATH Keywords: line-search
zbMATH Keywords: support vector machines
describes a project that uses: SSVM
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: s12190-019-01305-7
OpenAlex ID: W2991495381
Wikidata QID: Q126624376
cites work: Preconditioning indefinite systems in interior point methods for optimization
cites work: Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: Q4499068
cites work: Support-vector networks
cites work: A Preconditioner for A Primal-Dual Newton Conjugate Gradient Method for Compressed Sensing Problems
cites work: On preconditioner updates for sequences of saddle-point linear systems
cites work: Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: A primal-dual regularized interior-point method for convex quadratic programs
cites work: Matrix-free interior point method
cites work: Matrix Analysis
cites work: Predictor-corrector smoothing Newton method, based on a new smoothing function, for solving the nonlinear complementarity problem with a \(P_0\) function
cites work: Smoothing algorithms for complementarity problems over symmetric cones
cites work: Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
cites work: Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP
cites work: A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: SSVM: A smooth support vector machine for classification
cites work: Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods
cites work: A comparison of reduced and unreduced KKT systems arising from interior point methods
cites work: A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
cites work: A matrix-free smoothing algorithm for large-scale support vector machines
cites work: Preconditioning PDE-constrained optimization with \(L^1\)-sparsity and control constraints
cites work: A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
cites work: A smoothing Newton method for minimizing a sum of Euclidean norms
cites work: Q3816922
cites work: Q4261789
cites work: A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
DOI: 10.1007/S12190-019-01305-7
description: scientific article; zbMATH DE number 7435279