IDEAS home Printed from https://ideas.repec.org/a/gam/jforec/v7y2025i4p64-d1779943.html

Non-Negative Forecast Reconciliation: Optimal Methods and Operational Solutions

Author

Listed:
  • Daniele Girolimetto

    (Department of Statistical Sciences, University of Padova, 35121 Padova, Italy)

Abstract

In many different applications such as retail, energy, and tourism, forecasts for a set of related time series must satisfy both linear and non-negativity constraints, as negative values are meaningless in practice. Standard regression-based reconciliation approaches achieve coherence with linear constraints, but may generate negative forecasts, reducing interpretability and usability. This paper develops and evaluates three alternative strategies for non-negative forecast reconciliation. First, reconciliation is formulated as a non-negative least squares problem and solved with the operator splitting quadratic program, allowing flexible inclusion of additional constraints. Second, we propose an iterative non-negative reconciliation with immutable forecasts, offering a practical optimization-based alternative. Third, we investigate a family of set-negative-to-zero heuristics that achieve efficiency and interpretability at minimal computational cost. Using the Australian Tourism Demand dataset, we compare these approaches in terms of forecast accuracy and computation time. The results show that non-negativity constraints consistently improve accuracy compared to base forecasts. Overall, set-negative-to-zero achieve near-optimal performance with negligible computation time, the block principal pivoting algorithm provides a good accuracy–efficiency compromise, and the operator splitting quadratic program offers flexibility for incorporating additional constraints in large-scale applications.

Suggested Citation

  • Daniele Girolimetto, 2025. "Non-Negative Forecast Reconciliation: Optimal Methods and Operational Solutions," Forecasting, MDPI, vol. 7(4), pages 1-29, October.
  • Handle: RePEc:gam:jforec:v:7:y:2025:i:4:p:64-:d:1779943
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2571-9394/7/4/64/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2571-9394/7/4/64/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jforec:v:7:y:2025:i:4:p:64-:d:1779943. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.