This study introduces a new distance measure, Root-Mean-Squared iterative closest point (RMS-ICP) algorithm to significantly improve the robustness of the algorithm, and reduce the influence of ...

We propose and study a new iterative coordinate descent algorithm (QICD) for solving nonconvex penalized quantile regression in high dimension. By permitting different subsets of covariates to be ...

By transforming operands into a Montgomery domain, these algorithms enable efficient modular multiplication and exponentiation, which are crucial for public-key cryptosystems.