Sharpening comparisons via Gaussian copulas and semidefinite programming. Henderson, S. G. & Ehrlichman, S. M. T. ACM Transactions on Modeling and Computer Simulation, 22(4):Article 22, 2012. ![Sharpening comparisons via Gaussian copulas and semidefinite programming [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper abstract bibtex A common problem in operations research involves comparing two system designs through simulation of both systems. The comparison can often be made more accurate through careful control (coupling) of the random numbers that are used in simulating each system, with common random numbers being the standard example. We describe a new approach for coupling the random-number inputs to two systems that involves generating realizations of a Gaussian random vector and then transforming the Gaussian random vector into the desired random-number inputs. We use nonlinear semidefinite programming to select the correlation matrix of the Gaussian random vector, with the goal of sharpening the comparison.
@article{henehr12,
abstract = {A common problem in operations research involves comparing two system designs through simulation of both systems. The comparison can often be made more accurate through careful control (coupling) of the random numbers that are used in simulating each system, with common random numbers being the standard example. We describe a new approach for coupling the random-number inputs to two systems that involves generating realizations of a Gaussian random vector and then transforming the Gaussian random vector into the desired random-number inputs. We use nonlinear semidefinite programming to select the correlation matrix of the Gaussian random vector, with the goal of sharpening the comparison.},
annote = {pubs/sharpening.pdf},
author = {Shane G. Henderson and Samuel M. T. Ehrlichman},
date-added = {2016-01-10 16:07:54 +0000},
date-modified = {2018-07-16 17:44:22 +0000},
journal = {ACM Transactions on Modeling and Computer Simulation},
number = {4},
pages = {Article 22},
title = {Sharpening comparisons via {G}aussian copulas and semidefinite programming},
url_paper = {https://dl.acm.org/authorize?N654064},
volume = {22},
year = {2012}}
Downloads: 0
{"_id":"AEMC8BXYafFJpTzQo","bibbaseid":"henderson-ehrlichman-sharpeningcomparisonsviagaussiancopulasandsemidefiniteprogramming-2012","downloads":0,"creationDate":"2016-01-10T17:44:24.473Z","title":"Sharpening comparisons via Gaussian copulas and semidefinite programming","author_short":["Henderson, S. G.","Ehrlichman, S. M. T."],"year":2012,"bibtype":"article","biburl":"https://people.orie.cornell.edu/shane/ShanePubs.bib","bibdata":{"bibtype":"article","type":"article","abstract":"A common problem in operations research involves comparing two system designs through simulation of both systems. The comparison can often be made more accurate through careful control (coupling) of the random numbers that are used in simulating each system, with common random numbers being the standard example. We describe a new approach for coupling the random-number inputs to two systems that involves generating realizations of a Gaussian random vector and then transforming the Gaussian random vector into the desired random-number inputs. We use nonlinear semidefinite programming to select the correlation matrix of the Gaussian random vector, with the goal of sharpening the comparison.","annote":"pubs/sharpening.pdf","author":[{"firstnames":["Shane","G."],"propositions":[],"lastnames":["Henderson"],"suffixes":[]},{"firstnames":["Samuel","M.","T."],"propositions":[],"lastnames":["Ehrlichman"],"suffixes":[]}],"date-added":"2016-01-10 16:07:54 +0000","date-modified":"2018-07-16 17:44:22 +0000","journal":"ACM Transactions on Modeling and Computer Simulation","number":"4","pages":"Article 22","title":"Sharpening comparisons via Gaussian copulas and semidefinite programming","url_paper":"https://dl.acm.org/authorize?N654064","volume":"22","year":"2012","bibtex":"@article{henehr12,\n\tabstract = {A common problem in operations research involves comparing two system designs through simulation of both systems. The comparison can often be made more accurate through careful control (coupling) of the random numbers that are used in simulating each system, with common random numbers being the standard example. We describe a new approach for coupling the random-number inputs to two systems that involves generating realizations of a Gaussian random vector and then transforming the Gaussian random vector into the desired random-number inputs. We use nonlinear semidefinite programming to select the correlation matrix of the Gaussian random vector, with the goal of sharpening the comparison.},\n\tannote = {pubs/sharpening.pdf},\n\tauthor = {Shane G. Henderson and Samuel M. T. Ehrlichman},\n\tdate-added = {2016-01-10 16:07:54 +0000},\n\tdate-modified = {2018-07-16 17:44:22 +0000},\n\tjournal = {ACM Transactions on Modeling and Computer Simulation},\n\tnumber = {4},\n\tpages = {Article 22},\n\ttitle = {Sharpening comparisons via {G}aussian copulas and semidefinite programming},\n\turl_paper = {https://dl.acm.org/authorize?N654064},\n\tvolume = {22},\n\tyear = {2012}}\n\n","author_short":["Henderson, S. G.","Ehrlichman, S. M. T."],"key":"henehr12","id":"henehr12","bibbaseid":"henderson-ehrlichman-sharpeningcomparisonsviagaussiancopulasandsemidefiniteprogramming-2012","role":"author","urls":{" paper":"https://dl.acm.org/authorize?N654064"},"metadata":{"authorlinks":{"henderson, s":"https://people.orie.cornell.edu/"}}},"search_terms":["sharpening","comparisons","via","gaussian","copulas","semidefinite","programming","henderson","ehrlichman"],"keywords":[],"authorIDs":["Rzrm76FFjE8xtscXR"],"dataSources":["ZCuKDjctePZJeeaBw","SEqonpKnx4miWre2P"]}