New error bounds for linear complementarity problems of S-Nekrasov matrices and B–S-Nekrasov matrices
Sign Up to like & getrecommendations! Published in 2019 at "Computational and Applied Mathematics"
DOI: 10.1007/s40314-019-0818-4
Abstract: In this paper, we give new error bounds for linear complementarity problems when the involved matrices are S-Nekrasov matrices and B–S-Nekrasov matrices, respectively. We prove that the obtained bounds are better than those of Gao… read more here.
Keywords: nekrasov matrices; matrices nekrasov; linear complementarity; new error ... See more keywords
Computing semiparametric efficiency bounds in linear models with nonparametric regressors
Sign Up to like & getrecommendations! Published in 2019 at "Economics Letters"
DOI: 10.1016/j.econlet.2019.108673
Abstract: We use the computational method proposed by Severini and Tripathi (2001) to obtain semiparametric efficiency bounds in linear models with nonparametric regressors in the form of conditional expectations. Examples include social-interaction models. Explicit efficiency bounds… read more here.
Keywords: semiparametric efficiency; models nonparametric; efficiency bounds; bounds linear ... See more keywords
Sample Complexity Bounds for Linear System Identification From a Finite Set
Sign Up to like & getrecommendations! Published in 2024 at "IEEE Control Systems Letters"
DOI: 10.1109/lcsys.2024.3514995
Abstract: This letter considers a finite sample perspective on the problem of identifying an LTI system from a finite set of possible systems using trajectory data. To this end, we use the maximum likelihood estimator to… read more here.
Keywords: bounds linear; system; finite set; sample complexity ... See more keywords