A Class of Convex Optimization-Based Recursive Algorithms for Identification of Stochastic Systems
<|reference_start|>A Class of Convex Optimization-Based Recursive Algorithms for Identification of Stochastic Systems: Focusing on identification, this paper develops a class of convex optimization-based criteria and correspondingly the recursive algorithms to estimate the parameter vector $\theta^{*}$ of a stochastic dynamic system. Not only do the criteria include the classical least-squares estimator but also the $L_l=|\cdot|^l, l\geq 1$, the Huber, the Log-cosh, and the Quantile costs as special cases. First, we prove that the minimizers of the convex optimization-based criteria converge to $\theta^{*}$ with probability one. Second, the recursive algorithms are proposed to find the estimates, which minimize the convex optimization-based criteria, and it is shown that these estimates also converge to the true parameter vector with probability one. Numerical examples are given, justifying the performance of the proposed algorithms including the strong consistency of the estimates, the robustness against outliers in the observations, and higher efficiency in online computation compared with the kernel-based regularization method due to the recursive nature.<|reference_end|>
@article{ding2024a,
    title={A Class of Convex Optimization-Based Recursive Algorithms for
  Identification of Stochastic Systems},
    author={Mingxia Ding, Wenxiao Zhao, and Tianshi Chen},
    journal={arXiv preprint arXiv:2405.07483},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.07483},
    primaryClass={math.OC cs.SY eess.SY}
}