{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:16:28Z","timestamp":1743394588932,"version":"3.40.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T00:00:00Z","timestamp":1734307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-024-00403-y","type":"journal-article","created":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T08:48:37Z","timestamp":1734338917000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using Estimated Gradients in Bound-Constrained Global Optimization"],"prefix":"10.1007","volume":"6","author":[{"given":"C. J.","family":"Price","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. L.","family":"Robertson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,16]]},"reference":[{"key":"403_CR1","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"MM Ali","year":"2005","unstructured":"Ali MM, Khompatraporn C, Zabinsky ZB (2005) A numerical evaluation of several stochastic algorithms on several continuous global optimization test problems. J Global Optim 31:635\u2013672","journal-title":"J Global Optim"},{"key":"403_CR2","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1137\/S105262340240063X","volume":"14","author":"MJ Appel","year":"2003","unstructured":"Appel MJ, Labarre R, Radulovi\u0107 D (2003) On accelerated random search. SIAM J Optim 14:708\u2013731","journal-title":"SIAM J Optim"},{"key":"403_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1162\/EVCO_r_00180","volume":"25","author":"MR Bonyadi","year":"2017","unstructured":"Bonyadi MR, Michalewicz Z (2017) Particle swarm optimization for single objective continuous space problems: a review. Evol Comput 25:1\u201354","journal-title":"Evol Comput"},{"key":"403_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719857","volume-title":"Trust-region methods","author":"AR Conn","year":"2000","unstructured":"Conn AR, Gould NIM, Toint PhL (2000) Trust-region methods. MPS-SIAM Series on Optimization, Philadelphia"},{"key":"403_CR5","first-page":"156","volume":"13","author":"ID Coope","year":"1995","unstructured":"Coope ID, Price CJ (1995) A modified BFGS formula maintaining positive definiteness with Armijo-Goldstein steplengths. J Comput Math 13:156\u2013160","journal-title":"J Comput Math"},{"key":"403_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-014-0224-9","volume":"62","author":"AL Cust\u00f3dio","year":"2015","unstructured":"Cust\u00f3dio AL, Madeira JFA (2015) GLODS: global and local optimization using direct search. J Global Optim 62:1\u201328","journal-title":"J Global Optim"},{"key":"403_CR7","doi-asserted-by":"crossref","unstructured":"El Mouatasim A (2010) Two phase generalized reduced gradient method for constrained global optimization. J Appl Math 2010:976529","DOI":"10.1155\/2010\/976529"},{"key":"403_CR8","doi-asserted-by":"crossref","unstructured":"Gnandt C, Callies R (2018) CGRS \u2014 An advanced hybrid method for global optimization of continuous functions closely coupling extended random search and conjugate gradient method. J Comput Appl Math 333:99\u2013115","DOI":"10.1016\/j.cam.2017.10.018"},{"key":"403_CR9","unstructured":"Griewank A (1989) On automatic differentiation. Mathematical Programming (Tokyo 1988) Math Appl (Japanese Ser.) SCIPRESS Tokyo 6:83\u2013107"},{"key":"403_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1008382309369","volume":"14","author":"W Huyer","year":"1999","unstructured":"Huyer W, Neumaier A (1999) Global optimization by multilevel coordinate search. J Global Optim 14:331\u2013355","journal-title":"J Global Optim"},{"key":"403_CR11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones DR, Pertunnen CD, Stuckman BE (1993) Lipschitzian optimization without the Lipschitz constant. J Optim Theory Appl 79:157\u2013181","journal-title":"J Optim Theory Appl"},{"key":"403_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s12532-021-00215-9","volume":"14","author":"M Kimiaei","year":"2022","unstructured":"Kimiaei M, Neumaier A (2022) Efficient unconstrained black box optimization. Math Prog Comput 14:365\u2013414","journal-title":"Math Prog Comput"},{"key":"403_CR13","first-page":"187","volume":"23","author":"QF Liu","year":"2014","unstructured":"Liu QF (2014) Order 2 stability analysis of particle swarm optimization. Evol Comput 23:187\u2013216","journal-title":"Evol Comput"},{"key":"403_CR14","doi-asserted-by":"crossref","unstructured":"Locatelli M, Schoen F (2021) (Global) Optimization: historical notes and recent developments. EURO J Comput Optim 9:100012","DOI":"10.1016\/j.ejco.2021.100012"},{"key":"403_CR15","doi-asserted-by":"crossref","unstructured":"Mishra S (2007) Some new test functions for global optimization and performance of repulsive particle swarm method. MPRA paper No.\u00a02718. https:\/\/mpra.ub.uni-muenchen.de\/2718\/","DOI":"10.2139\/ssrn.926132"},{"key":"403_CR16","first-page":"522","volume":"221","author":"J M\u00fcller","year":"2013","unstructured":"M\u00fcller J, Kannaianen J, Pich\u00e9 R (2013) Calibration of GARCH models using concurrent accelerated random search. Appl Math Comput 221:522\u2013534","journal-title":"Appl Math Comput"},{"key":"403_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10898-010-9620-y","volume":"51","author":"J M\u00fcller","year":"2011","unstructured":"M\u00fcller J, Pich\u00e9 R (2011) Mixture surrogate models based on Dempster-Shafer theory for global optimization problems. J Global Optim 51:79\u2013104","journal-title":"J Global Optim"},{"key":"403_CR18","volume-title":"Numerical optimization","author":"J Nocedal","year":"2000","unstructured":"Nocedal J, Wright S (2000) Numerical optimization. Springer, USA"},{"key":"403_CR19","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.cam.2018.02.017","volume":"340","author":"L Nu\u00f1ez","year":"2018","unstructured":"Nu\u00f1ez L, Regis RG, Varela K (2018) Accelerated random search for constrained global optimization assisted by radial basis function surrogates. J Comput Appl Math 340:276\u2013295","journal-title":"J Comput Appl Math"},{"key":"403_CR20","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF01100691","volume":"5","author":"M Pogu","year":"1994","unstructured":"Pogu M, Souza de Cursi JE (1994) Global optimization by random perturbation of the gradient method with a fixed parameter. J Global Optim 5:159\u2013180","journal-title":"J Global Optim"},{"key":"403_CR21","doi-asserted-by":"crossref","first-page":"1059","DOI":"10.1080\/10556788.2011.557726","volume":"27","author":"CJ Price","year":"2012","unstructured":"Price CJ, Reale M, Robertson BL (2012) A cover partitioning method for bound constrained global optimization. Optim Methods Softw 27:1059\u20131072","journal-title":"Optim Methods Softw"},{"key":"403_CR22","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1007\/s11590-013-0631-8","volume":"8","author":"CJ Price","year":"2014","unstructured":"Price CJ, Reale M, Robertson BL (2014) One side cut accelerated random search: a direct search method for bound constrained global optimization. Optim Lett 8:1137\u20131148","journal-title":"Optim Lett"},{"key":"403_CR23","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10898-020-00928-6","volume":"79","author":"CJ Price","year":"2021","unstructured":"Price CJ, Reale M, Robertson BL (2021) OSCARS-II: an algorithm for bound constrained global optimization. J Global Optim 79:39\u201357","journal-title":"J Global Optim"},{"key":"403_CR24","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1080\/10556780500137116","volume":"21","author":"CJ Price","year":"2006","unstructured":"Price CJ, Toint PhL (2006) Exploiting problem structure in pattern search methods for unconstrained optimization. Optim. Methods Softw 21:479\u2013491","journal-title":"Optim. Methods Softw"},{"key":"403_CR25","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1080\/02331930701763447","volume":"59","author":"D Radulovi\u0107","year":"2010","unstructured":"Radulovi\u0107 D (2010) Pure random search with exponential rate of convergency. Optim 59:289\u2013303","journal-title":"Optim"},{"key":"403_CR26","doi-asserted-by":"crossref","unstructured":"Regis RG (2022) A hybrid surrogate assisted accelerated random search and trust region approach for constrained black-box optimization. Lecture notes in Computer Science 13164. Springer Cham pp 162\u2013177","DOI":"10.1007\/978-3-030-95470-3_12"},{"key":"403_CR27","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02592071","volume":"39","author":"AHG Rinnooy Kan","year":"1987","unstructured":"Rinnooy Kan AHG, Timmer GT (1987) Stochastic global optimization methods part II: multi level methods. Math Prog 39:57\u201378","journal-title":"Math Prog"},{"key":"403_CR28","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01096734","volume":"3","author":"F Schoen","year":"1993","unstructured":"Schoen F (1993) A wide class of test functions for global optimization. J Global Optim 3:133\u2013137","journal-title":"J Global Optim"},{"key":"403_CR29","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T Steihaug","year":"1983","unstructured":"Steihaug T (1983) The conjugate gradient method and trust regions in large scale optimization. SIAM J Numer Anal 20:626\u2013637","journal-title":"SIAM J Numer Anal"},{"key":"403_CR30","first-page":"57","volume-title":"Sparse matrices and their uses","author":"PhL Toint","year":"1981","unstructured":"Toint PhL (1981) Towards an efficient sparsity exploiting Newton method for minimization. In: Duff IS (ed) Sparse matrices and their uses. Academic Press, London, pp 57\u201378"},{"key":"403_CR31","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.cam.2016.12.021","volume":"317","author":"R Ziadi","year":"2017","unstructured":"Ziadi R, Ellaia R, Bencherif-Madani A (2017) Global optimization through a stochastic perturbation of the Polak-Ribi\u00e8re conjugate gradient method. J Comput Appl Math 317:672\u2013684","journal-title":"J Comput Appl Math"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00403-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00403-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00403-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T11:14:47Z","timestamp":1743333287000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00403-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,16]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["403"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00403-y","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,12,16]]},"assertion":[{"value":"29 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}],"article-number":"2"}}