Interior-Point Methods for Massive Support Vector Machines

From MaRDI portal
Revision as of 04:14, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4441923

DOI10.1137/S1052623400374379zbMath1039.90092DBLPjournals/siamjo/FerrisM02OpenAlexW2065887373WikidataQ56095194 ScholiaQ56095194MaRDI QIDQ4441923

Michael C. Ferris, Todd S. Munson

Publication date: 19 January 2004

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s1052623400374379




Related Items (29)

Fast projected gradient method for support vector machinesBinary separation and training support vector machinesClustering-based preconditioning for stochastic programsMulti-standard quadratic optimization: Interior point methods and cone programming reformulationRegularized multiple criteria linear programs for classificationSupervised classification and mathematical optimizationGradient projection methods for quadratic programs and applications in training support vector machinesHigh dimensional data classification and feature selection using support vector machinesUsing an iterative linear solver in an interior-point method for generating support vector machinesThe profitability of online loans: a competing risks analysis on default and prepaymentPenalized spline support vector classifiers computational issuesMatrix-free interior point methodAdaptive constraint reduction for convex quadratic programmingCutting-plane training of structural SVMsA random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraintsPNKH-B: A Projected Newton--Krylov Method for Large-Scale Bound-Constrained OptimizationA convergent decomposition algorithm for support vector machinesExploiting separability in large-scale linear support vector machine trainingA coordinate gradient descent method for linearly constrained smooth optimization and support vector machines trainingExploiting structure in parallel implementation of interior point methods for optimizationNonlinear optimization and support vector machinesA matrix-free smoothing algorithm for large-scale support vector machinesNonlinear optimization and support vector machinesGlobal resolution of the support vector machine regression parameters selection problem with LPCCDecomposition algorithm model for singly linearly-constrained problems subject to lower and Upper boundsA predictor-corrector affine scaling method to train optimized extreme learning machineImplementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioningIntroduction to Support Vector Machines and Their Applications in Bankruptcy PrognosisNearest neighbors methods for support vector machines


Uses Software






This page was built for publication: Interior-Point Methods for Massive Support Vector Machines