An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation

DOI10.1016/j.automatica.2013.09.021zbMath1348.90523OpenAlexW2167784729MaRDI QIDQ2350847

Roland Tóth, Dario Piga

Publication date: 25 June 2015

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.09.021

zbMATH Keywords

regularizationSDP relaxationsegmentationcompressive sensingsparse estimation\(\ell_0\)-minimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25)

Related Items (8)

Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory ⋮ Local R-linear convergence of ADMM-based algorithm for \(\ell_1\)-norm minimization with linear and box constraints ⋮ Rao-blackwellized sampling for batch and recursive Bayesian inference of piecewise affine models ⋮ Identification of hybrid and linear parameter‐varying models via piecewise affine regression using mixed integer programming ⋮ Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model ⋮ On sparsity‐inducing methods in system identification and state estimation ⋮ Estimation of jump Box-Jenkins models ⋮ A novel representation of rank constraints for real matrices

This page was built for publication: An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation