Reducing computational complexity in nonlinear model input design via sparse estimation
From MaRDI portal
Cites work
- A graph theoretical approach to input design for identification of nonlinear dynamical models
- D-optimal input design for nonlinear FIR-type systems: a dispersion-based approach
- Designing structured tight frames via an alternating projection method
- Dynamic system identification. Experiment design and data analysis
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 4015993 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Input design via LMIs admitting frequency-wise model specifications in confidence regions
- Methods of conjugate gradients for solving linear systems
- Necessary and sufficient conditions for uniqueness of the minimum in Prediction Error Identification
- On marginal distributions and isomorphisms of stationary processes
- On search directions for minimization algorithms
- Optimal experiment design for dynamic system identification
- Results on sparsity and estimation accuracy in orthogonal matching pursuit with application to optimal input design
- System identification of complex and structured systems
- The quickhull algorithm for convex hulls
This page was built for publication: Reducing computational complexity in nonlinear model input design via sparse estimation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6929900)