An SDP approach for _0-minimization: application to ARX model segmentation
From MaRDI portal
(Redirected from Publication:2350847)
An SDP approach for \(\ell 0\)-minimization: application to ARX model segmentation
An SDP approach for \(\ell 0\)-minimization: application to ARX model segmentation
Recommendations
- Complementarity formulations of \(\ell_0\)-norm optimization
- A smoothing method for sparse optimization over convex sets
- Equivalence of minimal \(\ell _{0}\)- and \(\ell _{p }\)-norm solutions of linear equalities, inequalities and linear programs for sufficiently small \(p\)
- Sparse approximate reconstruction decomposed by two optimization problems
- Uniqueness conditions for the sparsest solution of linear systems
Cited in
(9)- Model recovery for multi-input signal-output nonlinear systems based on the compressed sensing recovery theory
- Rao-blackwellized sampling for batch and recursive Bayesian inference of piecewise affine models
- Estimation of jump Box-Jenkins models
- Iterative identification for multiple-input systems with time-delays based on greedy pursuit and auxiliary model
- A novel representation of rank constraints for real matrices
- Identification of hybrid and linear parameter‐varying models via piecewise affine regression using mixed integer programming
- On sparsity‐inducing methods in system identification and state estimation
- An intelligent piecewise linear modeling approach from noisy data and its applications to water supply system
- Local R-linear convergence of ADMM-based algorithm for _1-norm minimization with linear and box constraints
This page was built for publication: An SDP approach for \(\ell_0\)-minimization: application to ARX model segmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350847)
