Data preordering in generalized PAV algorithm for monotonic regression

MaRDI QIDQ5440599zbMATH OpenFDO

Authors Oleg Burdakov, A. Grimvall, Oleg Sysoev

Publication date 5 February 2008

zbMATH Keywords

computational complexitylarge scale optimizationleast distance problemmonotonic regressionnumerical experimentspartially ordered data setpool-adjacent-violators algorithmquadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20)

Recommendations

• A segmentation-based algorithm for large-scale partially ordered monotonic regression
• Algorithms and error estimations for monotone regression on partially preordered sets
• Efficient computation of an isotonic median regression
• Isotonic regression under Lipschitz constraint
• The validity of the ``pool-adjacent-violator algorithm

Cited in

(4)

• The validity of the ``pool-adjacent-violator algorithm
• A segmentation-based algorithm for large-scale partially ordered monotonic regression
• A dual active-set algorithm for regularized monotonic regression
• Monotonicity recovering and accuracy preserving optimization methods for postprocessing finite element solutions

This page was built for publication: Data preordering in generalized PAV algorithm for monotonic regression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5440599)