IDEAS home Printed from https://ideas.repec.org/a/taf/tjsmxx/v13y2019i4p272-285.html
   My bibliography  Save this article

First-order intrinsic Gaussian Markov random fields for discrete optimisation via simulation

Author

Listed:
  • Peter Salemi

Abstract

We propose first-order intrinsic Gaussian Markov random fields (GMRFs) for Gaussian process (GP) regression of response surfaces, defined on a subset of the integer lattice, in operations research. These GMRFs have several desirable properties, including simple parameter estimation and no mean reversion. We focus on the application of GP regression with GMRFs to discrete optimisation via simulation (DOvS) using the Gaussian Markov improvement algorithm (GMIA). GMIA is a globally convergent GP-based algorithm for DOvS, which models the response surface as the realisation of a GMRF. The particular GMRF used in GMIA is a critical choice and influences the performance of the algorithm. We compare our first-order intrinsic GMRFs to the GMRF used in the original GMIA, provide details for parameter estimation, and discuss the global convergence of GMIA when our first-order intrinsic GMRFs are used. We then present numerical results showing the advantage of using GMIA with our first-order intrinsic GMRFs over the original GMRF.

Suggested Citation

  • Peter Salemi, 2019. "First-order intrinsic Gaussian Markov random fields for discrete optimisation via simulation," Journal of Simulation, Taylor & Francis Journals, vol. 13(4), pages 272-285, October.
  • Handle: RePEc:taf:tjsmxx:v:13:y:2019:i:4:p:272-285
    DOI: 10.1080/17477778.2018.1557989
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/17477778.2018.1557989
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/17477778.2018.1557989?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 search for a different version of it.

    Citations

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


    Cited by:

    1. Mark Semelhago & Barry L. Nelson & Eunhye Song & Andreas Wächter, 2021. "Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 915-930, July.

    More about this item

    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:taf:tjsmxx:v:13:y:2019:i:4:p:272-285. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjsm .

    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.