Adaptive constraint reduction for training support vector machines

zbMath1177.90308MaRDI QIDQ836799

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

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

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)

Related Items

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

Uses Software

• reducedLP