IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i5d10.1007_s10878-025-01323-1.html
   My bibliography  Save this article

Fitting and analyzing data with convex-area-wise linear regression models

Author

Listed:
  • Bohan Lyu

    (Harbin Institute of Technology
    Shenzhen University of Advanced Technology)

  • Jianzhong Li

    (Harbin Institute of Technology
    Shenzhen University of Advanced Technology)

Abstract

This paper introduces a new type of regression methodology named as Convex-Area-Wise Linear Regression(CALR), which separates given datasets by disjoint convex areas and fits different linear regression models for different areas. This regression model is highly interpretable for its close-form local models and boundaries, and it is able to interpolate any given finite datasets even when the underlying relationship between explanatory and response variables are non-linear and discontinuous. In order to construct CALR models for given datasets, accurate algorithms and an incremental algorithm are proposed under different assumptions. The analysis of correctness and time complexity of the algorithms are given, indicating that the problem can be solved in $$o(n^2)$$ o ( n 2 ) time accurately when the input datasets have some special features, or be solved in $$O(T(n_s)+n(M+d^2))$$ O ( T ( n s ) + n ( M + d 2 ) ) time incrementally using an $$n_s$$ n s -size initial subset to construct initial accurate model.

Suggested Citation

  • Bohan Lyu & Jianzhong Li, 2025. "Fitting and analyzing data with convex-area-wise linear regression models," Journal of Combinatorial Optimization, Springer, vol. 49(5), pages 1-29, July.
  • Handle: RePEc:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01323-1
    DOI: 10.1007/s10878-025-01323-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-025-01323-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-025-01323-1?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Toriello, Alejandro & Vielma, Juan Pablo, 2012. "Fitting piecewise linear continuous functions," European Journal of Operational Research, Elsevier, vol. 219(1), pages 86-95.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Jon Lee & Daphne Skipper & Emily Speakman & Luze Xu, 2023. "Gaining or Losing Perspective for Piecewise-Linear Under-Estimators of Convex Univariate Functions," Journal of Optimization Theory and Applications, Springer, vol. 196(1), pages 1-35, January.
    2. Noam Goldberg & Steffen Rebennack & Youngdae Kim & Vitaliy Krasko & Sven Leyffer, 2021. "MINLP formulations for continuous piecewise linear function fitting," Computational Optimization and Applications, Springer, vol. 79(1), pages 223-233, May.
    3. Huang, Zhiliang & Wang, Huaixing & Gan, Zhouwang & Yang, Tongguang & Yuan, Cong & Lei, Bing & Chen, Jie & Wu, Shengben, 2024. "An mechanical/thermal analytical model for prismatic lithium-ion cells with silicon‑carbon electrodes in charge/discharge cycles," Applied Energy, Elsevier, vol. 365(C).
    4. Jan Szczegielniak & Krzysztof J Latawiec & Jacek Łuniewski & Rafał Stanisławski & Katarzyna Bogacz & Marcin Krajczy & Marek Rydel, 2018. "A study on nonlinear estimation of submaximal effort tolerance based on the generalized MET concept and the 6MWT in pulmonary rehabilitation," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-18, February.
    5. Steffen Rebennack & Vitaliy Krasko, 2020. "Piecewise Linear Function Fitting via Mixed-Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 507-530, April.
    6. Lingxun Kong & Christos T. Maravelias, 2020. "On the Derivation of Continuous Piecewise Linear Approximating Functions," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 531-546, July.
    7. Wang, Yongqiao & Wang, Shouyang & Dang, Chuangyin & Ge, Wenxiu, 2014. "Nonparametric quantile frontier estimation under shape restriction," European Journal of Operational Research, Elsevier, vol. 232(3), pages 671-678.
    8. Fodstad, Marte & Crespo del Granado, Pedro & Hellemo, Lars & Knudsen, Brage Rugstad & Pisciella, Paolo & Silvast, Antti & Bordin, Chiara & Schmidt, Sarah & Straus, Julian, 2022. "Next frontiers in energy system modelling: A review on challenges and the state of the art," Renewable and Sustainable Energy Reviews, Elsevier, vol. 160(C).
    9. Ruobing Shen & Bo Tang & Leo Liberti & Claudia D’Ambrosio & Stéphane Canu, 2021. "Learning discontinuous piecewise affine fitting functions using mixed integer programming over lattice," Journal of Global Optimization, Springer, vol. 81(1), pages 85-108, September.
    10. John Alasdair Warwicker & Steffen Rebennack, 2022. "A Comparison of Two Mixed-Integer Linear Programs for Piecewise Linear Function Fitting," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1042-1047, March.
    11. Gambella, Claudio & Ghaddar, Bissan & Naoum-Sawaya, Joe, 2021. "Optimization problems for machine learning: A survey," European Journal of Operational Research, Elsevier, vol. 290(3), pages 807-828.
    12. Kazda, Kody & Li, Xiang, 2024. "A linear programming approach to difference-of-convex piecewise linear approximation," European Journal of Operational Research, Elsevier, vol. 312(2), pages 493-511.
    13. Huaiyu Zhu & Yun Pan & Kwang-Ting Cheng & Ruohong Huan, 2018. "A lightweight piecewise linear synthesis method for standard 12-lead ECG signals based on adaptive region segmentation," PLOS ONE, Public Library of Science, vol. 13(10), pages 1-22, October.
    14. Cody Allen & Mauricio Oliveira, 2022. "A Minimal Cardinality Solution to Fitting Sawtooth Piecewise-Linear Functions," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 930-959, March.
    15. Ploussard, Quentin, 2024. "Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation," European Journal of Operational Research, Elsevier, vol. 315(1), pages 50-62.
    16. Wu, Yaqing & Maravelias, Christos T., 2024. "Piecewise linear trees as surrogate models for system design and planning under high-frequency temporal variability," European Journal of Operational Research, Elsevier, vol. 315(2), pages 541-552.
    17. Emilio Carrizosa & Vanesa Guerrero & Dolores Romero Morales, 2023. "On mathematical optimization for clustering categories in contingency tables," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 17(2), pages 407-429, June.
    18. David Lucas dos Santos Abreu & Erlon Cristian Finardi, 2022. "Continuous Piecewise Linear Approximation of Plant-Based Hydro Production Function for Generation Scheduling Problems," Energies, MDPI, vol. 15(5), pages 1-23, February.
    19. Aakil M. Caunhye & Douglas Alem, 2023. "Practicable robust stochastic optimization under divergence measures with an application to equitable humanitarian response planning," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 759-806, September.
    20. Zheng, Xiao-Xue & Chang, Ching-Ter, 2021. "Topology design of remote patient monitoring system concerning qualitative and quantitative issues," Omega, Elsevier, vol. 98(C).

    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:spr:jcomop:v:49:y:2025:i:5:d:10.1007_s10878-025-01323-1. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.