This work deals with special decomposition techniques for the large quadratic program arising in training support vector machines. These approaches split the problem into a sequence of quadratic programming (QP) subproblems which can be solved by efficient gradient projection methods recently proposed. Owing to the ability of decomposing the problem into much larger subproblems than standard decomposition packages, these techniques show promising performance and are well suited for parallelization. Here, we discuss a crucial aspect for their effectiveness: the selection of the working set; that is, the index set of the variables to be optimized at each step through the QP subproblem. We analyze the most popular working set selections and develop a new selection strategy that improves the convergence rate of the decomposition schemes based on large sized working sets. The effectiveness of the proposed strategy within the gradient projection-based decomposition techniques is shown by numerical experiments on large benchmark problems, both in serial and in parallel environments.
|Data di pubblicazione:||2005|
|Titolo:||On the working set selection in gradient projection-based decomposition techniques for support vector machines|
|Autore/i:||Serafini, Thomas; Zanni, Luca|
|Codice identificativo ISI:||WOS:000233087900013|
|Codice identificativo Scopus:||2-s2.0-27744479938|
|Citazione:||On the working set selection in gradient projection-based decomposition techniques for support vector machines / Serafini, Thomas; Zanni, Luca. - In: OPTIMIZATION METHODS & SOFTWARE. - ISSN 1055-6788. - STAMPA. - 20(2005), pp. 583-596.|
|Tipologia||Articolo su rivista|
File in questo prodotto:
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris