{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,7]],"date-time":"2022-08-07T06:25:18Z","timestamp":1659853518507},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10898-013-0112-8","type":"journal-article","created":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T05:34:05Z","timestamp":1380519245000},"page":"317-331","source":"Crossref","is-referenced-by-count":5,"title":["A new hybrid classical-quantum algorithm for continuous global optimization problems"],"prefix":"10.1007","volume":"60","author":[{"given":"Pedro C. S.","family":"Lara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato","family":"Portugal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlile","family":"Lavor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,1]]},"reference":[{"key":"112_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10898-008-9332-8","volume":"45","author":"C Floudas","year":"2009","unstructured":"Floudas, C., Gounaris, C.: A review of recent advances in global optimization. J. Glob. Opt. 45, 3\u201338 (2009)","journal-title":"J. Glob. Opt."},{"key":"112_CR2","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1137\/040605072","volume":"15","author":"WP Baritompa","year":"2005","unstructured":"Baritompa, W.P., Bulger, D.W., Wood, G.R.: Grover\u2019s quantum algorithm applied to global optimization. SIAM J. Opt. 15, 1170\u20131184 (2005)","journal-title":"SIAM J. Opt."},{"key":"112_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10957-007-9168-2","volume":"133","author":"DW Bulger","year":"2007","unstructured":"Bulger, D.W.: Combining a local search and Grover\u2019s algorithm in black-box global optimisation. J. Opt. Theory Appl. 133, 289\u2013301 (2007)","journal-title":"J. Opt. Theory Appl."},{"key":"112_CR4","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ejor.2010.05.039","volume":"207","author":"Y Liu","year":"2010","unstructured":"Liu, Y., Koehler, G.J.: Using modifications to Grover\u2019s search algorithm for quantum global optimization. Eur. J. Oper. Res. 207, 620\u2013632 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"112_CR5","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s10898-011-9806-y","volume":"52","author":"Y Liu","year":"2011","unstructured":"Liu, Y., Koehler, G.J.: A hybrid method for quantum global optimization. J. Glob. Opt. 52, 607\u2013626 (2011)","journal-title":"J. Glob. Opt."},{"key":"112_CR6","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0375-9601(02)00187-1","volume":"296","author":"V Protopopescu","year":"2002","unstructured":"Protopopescu, V., Barhen, J.: Solving a class of continuous global optimization problems using quantum algorithms. Phys. Lett. A 296, 9\u201314 (2002)","journal-title":"Phys. Lett. A"},{"key":"112_CR7","volume-title":"Optimization and Control with Applications","author":"V Protopopescu","year":"2005","unstructured":"Protopopescu, V., Barhen, J., et al.: Quantum algorithm for continuous global optimization. In: Qi, L. (ed.) Optimization and Control with Applications. Springer, New York (2005)"},{"key":"112_CR8","unstructured":"D\u00fcrr, C., H\u00f8yer, P.: A quantum algorithm for finding the minimum, http:\/\/lanl.arxiv.org\/-abs\/quant-ph\/9607014 , (1999)"},{"key":"112_CR9","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik 46, 493\u2013506 (1998)","journal-title":"Fortschritte der Physik"},{"key":"112_CR10","unstructured":"Bulger, D.W.: Quantum basin hopping with gradient-based local optimisation. arXiv:quant-ph\/0507193 (2005)"},{"key":"112_CR11","doi-asserted-by":"crossref","first-page":"050501","DOI":"10.1103\/PhysRevLett.95.050501","volume":"95","author":"SP Jordan","year":"2005","unstructured":"Jordan, S.P.: Fast quantum algorithm for numerical gradient estimation. Phys. Rev. Lett. 95, 050501 (2005)","journal-title":"Phys. Rev. Lett."},{"key":"112_CR12","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79, 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"112_CR13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1142\/S021974990800361X","volume":"6","author":"LAB Kowada","year":"2008","unstructured":"Kowada, L.A.B., Lavor, C., Portugal, R., Figueiredo, C.H.: A new quantum algorithm to solve the minimum searching problem. Int. J. Quantum Inf. 6, 427\u2013436 (2008)","journal-title":"Int. J. Quantum Inf."},{"issue":"5","key":"112_CR14","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.V.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"112_CR15","doi-asserted-by":"crossref","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746\u20132751 (1999)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"112_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1008394806170","volume":"18","author":"EMT Hendrix","year":"2000","unstructured":"Hendrix, E.M.T., Klepper, O.: On uniform covering, adaptive random search and raspberries. J. Glob. Opt. 18(2), 143\u2013163 (2000)","journal-title":"J. Glob. Opt."},{"key":"112_CR17","unstructured":"Powell, M.J.D.: The BOBYQA algorithm for bound constrained optimization without derivatives. (2009)"},{"key":"112_CR18","unstructured":"Johnson, S.G.: The NLopt nonlinear-optimization package. http:\/\/ab-initio.mit.edu\/nlopt"},{"issue":"151","key":"112_CR19","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-Newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comput."},{"issue":"3","key":"112_CR20","first-page":"503","volume":"45","author":"DC Liu","year":"1989","unstructured":"Liu, D.C., Nocedal, J.: On the limited memory bfgs method for large scale optimization. Math. Program. 45(3), 503\u2013528 (1989)","journal-title":"Math. Program."},{"key":"112_CR21","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BF02592055","volume":"26","author":"Ron S Dembo","year":"1983","unstructured":"Dembo, Ron S., Steihaug, Trond: Truncated-newtono algorithms for large-scale unconstrained optimization. Math. Program. 26, 190\u2013212 (1983)","journal-title":"Math. Program."},{"issue":"2","key":"112_CR22","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1137\/S1052623499362822","volume":"12","author":"K Svanberg","year":"2002","unstructured":"Svanberg, K.: A class of globally convergent optimization methods based on conservative convex separable approximations. SIAM J. Opt. 12(2), 555\u2013573 (2002)","journal-title":"SIAM J. Opt."},{"key":"112_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1017\/S0962492900002841","volume":"7","author":"MJD Powell","year":"1998","unstructured":"Powell, M.J.D.: Direct search algorithms for optimization calculations. Acta Numerica 7, 287\u2013336 (1998)","journal-title":"Acta Numerica"},{"key":"112_CR24","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7, 308\u2013313 (1965)","journal-title":"Comput. J."},{"issue":"8","key":"112_CR25","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/355609.362324","volume":"16","author":"JoelA Richardson","year":"1973","unstructured":"Richardson, JoelA, Kuester, J.L.: Algorithm 454: the complex method for constrained optimization [e4]. Commun. ACM 16(8), 487\u2013489 (1973)","journal-title":"Commun. ACM"},{"issue":"2","key":"112_CR26","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1137\/0728030","volume":"28","author":"AR Conn","year":"1991","unstructured":"Conn, A.R., Gould, N.I.M., Toint, P.L.: A globally convergent augmented lagrangian algorithm for optimization with general constraints and simple bounds. SIAM J. Numer. Anal. 28(2), 545\u2013572 (1991)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"112_CR27","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1080\/10556780701577730","volume":"23","author":"EG Birgin","year":"2008","unstructured":"Birgin, E.G., Mart\u00ednez, J.M.: Improving ultimate convergence of an augmented Lagrangian method. Opt. Methods Softw. 23(2), 177\u2013195 (2008)","journal-title":"Opt. Methods Softw."},{"key":"112_CR28","unstructured":"Thomas Harvey, R.: Functional stability analysis of numerical algorithms. Ph.D. Thesis, Austin. UMI Order No. GAX90-31702 (1990)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0112-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-013-0112-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-013-0112-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:59:05Z","timestamp":1559264345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-013-0112-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,1]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["112"],"URL":"https:\/\/doi.org\/10.1007\/s10898-013-0112-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,1]]}}}