.png){kind=icon}
.png){kind=icon}
Return
A dynamic programming approach for generalized nearly isotonic optimization
.png){kind=icon}
PRE
AI
DOI：10.1007/s12532-022-00229-x.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Shape restricted statistical estimation problems have been extensively studied, with many important practical applications in signal processing, bioinformatics, and machine learning. In this paper, we propose and study a generalized nearly isotonic optimization (GNIO) model, which recovers, as special cases, many classic problems in shape constrained statistical regression, such as isotonic regression, nearly isotonic regression and unimodal regression problems. We develop an efficient and easy-to-implement dynamic programming algorithm for solving the proposed model whose recursion nature is carefully uncovered and exploited. For special l(2)-GNIO problems, implementation details and the optimal O(n) running time analysis of our algorithm are discussed. Numerical experiments, including the comparisons among our approach, the powerful commercial solver Gurobi, and existing fast algorithms for solving l(1)-GNIO and l(2)-GNIO problems, on both simulated and real data sets, are presented to demonstrate the high efficiency and robustness of our proposed algorithm in solving large scale GNIO problems.
Keywords:
Dynamic programming
Generalized nearly isotonic optimization
Shape constrained statistical regression
Journal
IF:
3.6
Papers:
197
Citations:
1.9K