We tackle the sparsity constrained optimization problem by resorting to polyhedral k-norm as a valid tool to emulate the (Formula presented.) -pseudo-norm. The main novelty of the approach is the use of the dual of the k-norm, which allows to obtain a formulation amenable for a relaxation that can be efficiently handled by block coordinate methods. The advantage of the approach is that it does not require the solution of difference-of-convex programmes, unlike other k-norm based methods available in the literature. In fact, our block coordinate approach requires, at each iteration, the solution of two convex programmes, one of which can be solved in (Formula presented.) time. We apply the method to feature selection within the framework of Support Vector Machine classification, and we report the results obtained on some benchmark test problems.

Dual formulation of the sparsity constrained optimization problem: application to classification

Gaudioso M.;Giallombardo G.
;
2023-01-01

Abstract

We tackle the sparsity constrained optimization problem by resorting to polyhedral k-norm as a valid tool to emulate the (Formula presented.) -pseudo-norm. The main novelty of the approach is the use of the dual of the k-norm, which allows to obtain a formulation amenable for a relaxation that can be efficiently handled by block coordinate methods. The advantage of the approach is that it does not require the solution of difference-of-convex programmes, unlike other k-norm based methods available in the literature. In fact, our block coordinate approach requires, at each iteration, the solution of two convex programmes, one of which can be solved in (Formula presented.) time. We apply the method to feature selection within the framework of Support Vector Machine classification, and we report the results obtained on some benchmark test problems.
2023
block coordinate methods
cardinality constraint
polyhedral k-norm
Sparse optimization
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/360802
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact