Adaptive constraint reduction for training support vector machines

zbMATH Open1177.90308MaRDI QIDQ836799FDOQ836799

André L. Tits, Dianne P. O'Leary, Jin Hyuk Jung

Publication date: 8 September 2009

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117673

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

column generationprimal-dual interior-point method

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) General topics in the theory of algorithms (68W01)

Cited In (8)

• Nearest neighbors methods for support vector machines
• Adaptive pruning algorithm for least squares support vector machine classifier
• Clustering-based preconditioning for stochastic programs
• A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
• Adaptive constraint reduction for convex quadratic programming
• A polynomial time constraint-reduced algorithm for semidefinite optimization problems
• A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme
• An infeasible-start framework for convex quadratic optimization, with application to constraint-reduced interior-point and other methods

Uses Software

• reducedLP

This page was built for publication: Adaptive constraint reduction for training support vector machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q836799)