IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v56y2008i1p140-156.html
   My bibliography  Save this article

Arrival Rate Approximation by Nonnegative Cubic Splines

Author

Listed:
  • Farid Alizadeh

    (Department of Management Science and Information Systems, Business School and RUTCOR, Rutgers University, Piscataway, New Jersey 08854)

  • Jonathan Eckstein

    (Department of Management Science and Information Systems, Business School and RUTCOR, Rutgers University, Piscataway, New Jersey 08854)

  • Nilay Noyan

    (Faculty of Engineering and Natural Sciences, Sabanci University, Orhanli, Tuzla, 34956 Istanbul, Turkey)

  • Gábor Rudolf

    (RUTCOR, Rutgers University, Piscataway, New Jersey 08854)

Abstract

We describe an optimization method to approximate the arrival-rate function of a nonhomogeneous Poisson process based on observed arrival data. We estimate the function by cubic splines, using an optimization model based on the maximum-likelihood principle. A critical feature of the model is that the splines are constrained to be nonnegative everywhere. We enforce these constraints by using a characterization of nonnegative polynomials by positive semidefinite matrices. We also describe versions of our model that allow for periodic arrival-rate functions and input data of limited time precision. We formulate the estimation problem as a convex nonlinear program, and solve it with standard nonlinear optimization packages. We present numerical results using both an actual record of e-mail arrivals over a period of 60 weeks, and artificially generated data sets. We also present a cross-validation procedure for determining an appropriate number of spline knots to model a set of arrival observations.

Suggested Citation

  • Farid Alizadeh & Jonathan Eckstein & Nilay Noyan & Gábor Rudolf, 2008. "Arrival Rate Approximation by Nonnegative Cubic Splines," Operations Research, INFORMS, vol. 56(1), pages 140-156, February.
    • Handle: RePEc:inm:oropre:v:56:y:2008:i:1:p:140-156
    DOI: 10.1287/opre.1070.0443
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1070.0443
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1070.0443?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
    ---><---

    References listed on IDEAS

    as
    1. NESTEROV, Yu., 2000. "Squared functional systems and optimization problems," LIDAM Reprints CORE 1472, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Kuhl, Michael E. & Wilson, James R., 2001. "Modeling and simulating Poisson processes having trends or nontrigonometric cyclic effects," European Journal of Operational Research, Elsevier, vol. 133(3), pages 566-582, September.
    3. Michael E. Kuhl & Sachin G. Sumant & James R. Wilson, 2006. "An Automated Multiresolution Procedure for Modeling Complex Arrival Processes," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 3-18, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Farid Alizadeh & David Papp, 2013. "Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming," Annals of Operations Research, Springer, vol. 208(1), pages 291-308, September.
    2. Lakshman S. Thakur & Mikhail A. Bragin, 2021. "Data Interpolation by Near-Optimal Splines with Free Knots Using Linear Programming," Mathematics, MDPI, vol. 9(10), pages 1-12, May.

    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. Farid Alizadeh & David Papp, 2013. "Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming," Annals of Operations Research, Springer, vol. 208(1), pages 291-308, September.
    2. Wang, Wei & Xu, Huifu & Ma, Tiejun, 2023. "Optimal scenario-dependent multivariate shortfall risk measure and its application in risk capital allocation," European Journal of Operational Research, Elsevier, vol. 306(1), pages 322-347.
    3. Kato, Naohiro & Kuriki, Satoshi, 2013. "Likelihood ratio tests for positivity in polynomial regressions," Journal of Multivariate Analysis, Elsevier, vol. 115(C), pages 334-346.
    4. Sturm, J.F. & Zhang, S., 2001. "On Cones of Nonnegative Quadratic Functions," Discussion Paper 2001-26, Tilburg University, Center for Economic Research.
    5. Liyun Dai & Bican Xia, 2015. "Smaller SDP for SOS decomposition," Journal of Global Optimization, Springer, vol. 63(2), pages 343-361, October.
    6. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Discussion Paper 2005-73, Tilburg University, Center for Economic Research.
    7. Siem, A.Y.D. & de Klerk, E. & den Hertog, D., 2005. "Discrete Least-norm Approximation by Nonnegative (Trigonomtric) Polynomials and Rational Functions," Other publications TiSEM 43a1152a-8130-4e42-851b-e, Tilburg University, School of Economics and Management.
    8. Jibetean, D. & de Klerk, E., 2006. "Global optimization of rational functions : A semidefinite programming approach," Other publications TiSEM 25febbc3-cd0c-4eb7-9d37-d, Tilburg University, School of Economics and Management.
    9. Jos F. Sturm & Shuzhong Zhang, 2003. "On Cones of Nonnegative Quadratic Functions," Mathematics of Operations Research, INFORMS, vol. 28(2), pages 246-267, May.
    10. Sönke Behrends & Ruth Hübner & Anita Schöbel, 2018. "Norm bounds and underestimators for unconstrained polynomial integer minimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 73-107, February.
    11. Roland Hildebrand, 2022. "Semi-definite Representations for Sets of Cubics on the Two-dimensional Sphere," Journal of Optimization Theory and Applications, Springer, vol. 195(2), pages 666-675, November.
    12. DEVOLDER, Olivier & GLINEUR, François & NESTEROV, Yurii, 2010. "Solving infinite-dimensional optimization problems by polynomial approximation," LIDAM Discussion Papers CORE 2010029, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    13. Monique Laurent, 2003. "A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0--1 Programming," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 470-496, August.
    14. de Klerk, E. & Elfadul, G.E.E. & den Hertog, D., 2006. "Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming," Discussion Paper 2006-26, Tilburg University, Center for Economic Research.
    15. Ira Gerhardt & Barry L. Nelson, 2009. "Transforming Renewal Processes for Simulation of Nonstationary Arrival Processes," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 630-640, November.
    16. Wu, Zhiyou & Tian, Jing & Quan, Jing & Ugon, Julien, 2014. "Optimality conditions and optimization methods for quartic polynomial optimization," Applied Mathematics and Computation, Elsevier, vol. 232(C), pages 968-982.
    17. Ivanov, I.D. & de Klerk, E., 2007. "Parallel Implementation of a Semidefinite Programming Solver based on CSDP in a distributed memory cluster," Discussion Paper 2007-20, Tilburg University, Center for Economic Research.
    18. Karthik Natarajan & Chung Piaw Teo & Zhichao Zheng, 2011. "Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation," Operations Research, INFORMS, vol. 59(3), pages 713-728, June.
    19. Zhi Chen & Melvyn Sim & Huan Xu, 2019. "Distributionally Robust Optimization with Infinitely Constrained Ambiguity Sets," Operations Research, INFORMS, vol. 67(5), pages 1328-1344, September.
    20. Jenny Carolina Saldana Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," Documentos CEDE 8735, Universidad de los Andes, Facultad de Economía, CEDE.

    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:inm:oropre:v:56:y:2008:i:1:p:140-156. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.