@article{palfrahen16,
	abstract = {We consider the problem of solving multiple ``coupled'' root-finding problems at once, in that we can evaluate every function at the same point simultaneously. Using a dynamic programming formulation, we show that a sequential bisection algorithm is a close-to-optimal method for finding a ranking with respect to the zeros of these functions. We show the ranking can be found in linear time, prove an asymptotic approximation guarantee of 1.44, and conjecture that this policy is near-optimal.},
	author = {Stephen Pallone and Peter I. Frazier and Shane G. Henderson},
	date-added = {2016-01-10 16:07:54 +0000},
	date-modified = {2016-02-01 18:00:07 +0000},
	journal = {Operations Research Letters},
	number = {2},
	pages = {165--169},
	title = {Coupled bisection for root ordering},
	url_paper = {pubs/CoupledBisection.pdf},
	volume = {44},
	year = {2016}}

{"_id":"Fbuj6M7iu9HFM2hX5","bibbaseid":"pallone-frazier-henderson-coupledbisectionforrootordering-2016","downloads":2,"creationDate":"2016-01-10T17:44:24.709Z","title":"Coupled bisection for root ordering","author_short":["Pallone, S.","Frazier, P. I.","Henderson, S. G."],"year":2016,"bibtype":"article","biburl":"https://people.orie.cornell.edu/shane/ShanePubs.bib","bibdata":{"bibtype":"article","type":"article","abstract":"We consider the problem of solving multiple ``coupled'' root-finding problems at once, in that we can evaluate every function at the same point simultaneously. Using a dynamic programming formulation, we show that a sequential bisection algorithm is a close-to-optimal method for finding a ranking with respect to the zeros of these functions. We show the ranking can be found in linear time, prove an asymptotic approximation guarantee of 1.44, and conjecture that this policy is near-optimal.","author":[{"firstnames":["Stephen"],"propositions":[],"lastnames":["Pallone"],"suffixes":[]},{"firstnames":["Peter","I."],"propositions":[],"lastnames":["Frazier"],"suffixes":[]},{"firstnames":["Shane","G."],"propositions":[],"lastnames":["Henderson"],"suffixes":[]}],"date-added":"2016-01-10 16:07:54 +0000","date-modified":"2016-02-01 18:00:07 +0000","journal":"Operations Research Letters","number":"2","pages":"165–169","title":"Coupled bisection for root ordering","url_paper":"pubs/CoupledBisection.pdf","volume":"44","year":"2016","bibtex":"@article{palfrahen16,\n\tabstract = {We consider the problem of solving multiple ``coupled'' root-finding problems at once, in that we can evaluate every function at the same point simultaneously. Using a dynamic programming formulation, we show that a sequential bisection algorithm is a close-to-optimal method for finding a ranking with respect to the zeros of these functions. We show the ranking can be found in linear time, prove an asymptotic approximation guarantee of 1.44, and conjecture that this policy is near-optimal.},\n\tauthor = {Stephen Pallone and Peter I. Frazier and Shane G. Henderson},\n\tdate-added = {2016-01-10 16:07:54 +0000},\n\tdate-modified = {2016-02-01 18:00:07 +0000},\n\tjournal = {Operations Research Letters},\n\tnumber = {2},\n\tpages = {165--169},\n\ttitle = {Coupled bisection for root ordering},\n\turl_paper = {pubs/CoupledBisection.pdf},\n\tvolume = {44},\n\tyear = {2016}}\n\n","author_short":["Pallone, S.","Frazier, P. I.","Henderson, S. G."],"key":"palfrahen16","id":"palfrahen16","bibbaseid":"pallone-frazier-henderson-coupledbisectionforrootordering-2016","role":"author","urls":{" paper":"https://people.orie.cornell.edu/shane/pubs/CoupledBisection.pdf"},"metadata":{"authorlinks":{"henderson, s":"https://people.orie.cornell.edu/shane/"}},"downloads":2},"search_terms":["coupled","bisection","root","ordering","pallone","frazier","henderson"],"keywords":[],"authorIDs":["Rzrm76FFjE8xtscXR"],"dataSources":["ZCuKDjctePZJeeaBw","SEqonpKnx4miWre2P"]}