A Dual Active-Set Algorithm for Regularized Monotonic Regression

作者：Burdakov Oleg^*; Sysoev Oleg

来源：Journal of Optimization Theory and Applications, 2017, 172(3): 929-949.

DOI：10.1007/s10957-017-1060-0

• Large-scale optimization
• Monotonic regression
• Regularization
• Quadratic penalty
• Convex quadratic optimization
• Dual active-set method

Monotonic (isotonic) regression is a powerful tool used for solving a wide range of important applied problems. One of its features, which poses a limitation on its use in some areas, is that it produces a piecewise constant fitted response. For smoothing the fitted response, we introduce a regularization term in the monotonic regression, formulated as a least distance problem with monotonicity constraints. The resulting smoothed monotonic regression is a convex quadratic optimization problem. We focus on the case, where the set of observations is completely (linearly) ordered. Our smoothed pool-adjacent-violators algorithm is designed for solving the regularized problem. It belongs to the class of dual active-set algorithms. We prove that it converges to the optimal solution in a finite number of iterations that does not exceed the problem size. One of its advantages is that the active set is progressively enlarging by including one or, typically, more constraints per iteration. This resulted in solving large-scale test problems in a few iterations, whereas the size of that problems was prohibitively too large for the conventional quadratic optimization solvers. Although the complexity of our algorithm grows quadratically with the problem size, we found its running time to grow almost linearly in our computational experiments.

• 出版日期2017-3