{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:07Z","timestamp":1740145147613,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T00:00:00Z","timestamp":1711843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T00:00:00Z","timestamp":1711843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100008414","name":"University of Canterbury","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100008414","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2025,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>A derivative free method for generally constrained global optimization is described. A non-smooth merit function with one parameter is used. When this parameter equals the optimal objective function value <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$f^*$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>f<\/mml:mi>\n                    <mml:mo>\u2217<\/mml:mo>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, the merit function becomes an exact penalty function. The method estimates <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$f^*$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mi>f<\/mml:mi>\n                    <mml:mo>\u2217<\/mml:mo>\n                  <\/mml:msup>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, avoiding the need for it to be supplied. The method randomly samples the region satisfying the simple bounds from time to time, ensuring convergence almost surely. Other samples are drawn randomly from smaller regions considered promising. Numerical testing is done using a variety of bound constrained problems and generally constrained problems from the G-suite and elsewhere. Results show the method is competitive in practice. They also show that the method performs better when it estimates the optimal objective function value than when the actual value is used.<\/jats:p>","DOI":"10.1007\/s11590-024-02109-w","type":"journal-article","created":{"date-parts":[[2024,3,31]],"date-time":"2024-03-31T07:01:38Z","timestamp":1711868498000},"page":"103-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending oscars-ii to generally constrained global optimization"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6776-0037","authenticated-orcid":false,"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"}]},{"given":"M.","family":"Reale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,31]]},"reference":[{"key":"2109_CR1","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1080\/02331934.2012.655691","volume":"63","author":"MM Ali","year":"2014","unstructured":"Ali, M.M., Golakhani, C.M., Zhuang, J.: A computational study of different penalty approaches for solving constrained global optimization problems with the electromagnetism-like method. J. Optim. 63, 403\u2013419 (2014)","journal-title":"J. Optim."},{"key":"2109_CR2","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1137\/S105262340240063X","volume":"14","author":"MJ Appel","year":"2003","unstructured":"Appel, M.J., Labarre, R., Radulovi\u0107, D.: On accelerated random search. SIAM J. Optim. 14, 708\u2013731 (2003)","journal-title":"SIAM J. Optim."},{"key":"2109_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1002\/nme.2904","volume":"84","author":"VS Arag\u00f3n","year":"2010","unstructured":"Arag\u00f3n, V.S., Esquivel, S.C., Coello, C.A.C.: A modified version of a T-cell algorithm for constrained optimization problems. Int. J. Numer. Methods Eng. 84, 351\u2013378 (2010)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"2109_CR4","doi-asserted-by":"crossref","unstructured":"Cagnina, L., Esquivel, S., Coello, C.A.C.: A bi-population PSO with a shake-mechanism for solving constrained numerical optimization. In: 2007 IEEE Congress on Evolutionary Computation (CEC\u20192007), Singapore 2007, pp.\u00a0670-676. IEEE Press, New York (2007)","DOI":"10.1109\/CEC.2007.4424535"},{"key":"2109_CR5","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., G\u00fcm\u00fcs, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of test problems in local and global optimization. In: Nonconvex Optimization and its Applications, vol. 33. Kluwer, Dordrecht (1999)","DOI":"10.1007\/978-1-4757-3040-1_5"},{"key":"2109_CR6","doi-asserted-by":"crossref","unstructured":"Floudas, C.A., Pardalos, P.M.: A collection of test problems for constrained global optimization problems. In: Lecture notes in Computer Science, vol. 455. Springer, Berlin (1990)","DOI":"10.1007\/3-540-53032-0"},{"key":"2109_CR7","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-005-3693-z","volume":"35","author":"A-R Hedar","year":"2006","unstructured":"Hedar, A.-R., Fukushima, M.: Derivative free filter simulated annealing method for constrained continuous global optimization. J. Glob. Optim. 35, 521\u2013549 (2006)","journal-title":"J. Glob. Optim."},{"key":"2109_CR8","doi-asserted-by":"crossref","unstructured":"Gomez, S., Levy, A.: The tunneling method for solving the constrained global optimization problem with several non-connected feasible regions. In: Dold, A., Eckmann, B. (eds.) Lecture Notes in Mathematics, vol. 909, pp.\u00a034\u201347. Springer (1982)","DOI":"10.1007\/BFb0092958"},{"key":"2109_CR9","doi-asserted-by":"crossref","unstructured":"Jones, D.R.: The DIRECT global optimization algorithm. In: Floudas C.A., Pardalos P.M. (eds.) Encyclopaedia of Optimization, pp.\u00a0433\u2013440. Springer, Boston (2001)","DOI":"10.1007\/0-306-48332-7_93"},{"key":"2109_CR10","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Pertunnen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79, 157\u2013181 (1993)","journal-title":"J. Optim. Theory Appl."},{"key":"2109_CR11","doi-asserted-by":"publisher","first-page":"1505","DOI":"10.1007\/s00158-018-1978-3","volume":"58","author":"Z Liu","year":"2018","unstructured":"Liu, Z., Li, Z., Zhu, P., Chen, E.: A parallel boundary search particle swarm optimization algorithm for constrained optimization problems. Struct. Multidiscip. Optim. 58, 1505\u20131522 (2018)","journal-title":"Struct. Multidiscip. Optim."},{"key":"2109_CR12","unstructured":"Luk\u0161an, L., Vl\u010dek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technical Report 798, Prague: Institute of Computer Science, Academy of Sciences of the Czech Republic (2000)"},{"key":"2109_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1162\/evco.1999.7.1.19","volume":"7","author":"S Koziel","year":"1999","unstructured":"Koziel, S., Michalewicz, Z.: Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evol. Comput. 7, 19\u201344 (1999)","journal-title":"Evol. Comput."},{"key":"2109_CR14","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1016\/j.engappai.2013.02.002","volume":"26","author":"I Mazhoud","year":"2013","unstructured":"Mazhoud, I., Hadj-Hamou, K., Bigen, J., Joyeux, P.: Particle swarm optimization for solving engineering problems: a new constraint handling mechanism. Eng. Appl. Artif. Intell. 26, 1263\u20131273 (2013)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"2109_CR15","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10898-020-00917-9","volume":"77","author":"MJFG Mac\u00eado","year":"2020","unstructured":"Mac\u00eado, M.J.F.G., Karas, E.W., Costa, M.F.P., Rocha, A.M.A.C.: Filter-based stochastic algorithm for global optimization. J. Glob. Optim. 77, 777\u2013805 (2020)","journal-title":"J. Glob. Optim."},{"key":"2109_CR16","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.swevo.2011.10.001","volume":"1","author":"E Mezura-Montes","year":"2011","unstructured":"Mezura-Montes, E., Coello, C.A.C.: Constraint handling in nature-inspired numerical optimization: past, present and future. Swarm Evol. Comput. 1, 173\u2013194 (2011)","journal-title":"Swarm Evol. Comput."},{"key":"2109_CR17","doi-asserted-by":"publisher","first-page":"4223","DOI":"10.1016\/j.ins.2010.07.023","volume":"180","author":"E Mezura-Montes","year":"2010","unstructured":"Mezura-Montes, E., Miranda-Varela, M.E., del Carmen G\u00f3mez-Ram\u00f3n, R.: Differential evolution in constrained numerical optimization: an empirical study. Inf. Sci. 180, 4223\u20134262 (2010)","journal-title":"Inf. Sci."},{"key":"2109_CR18","unstructured":"Michalewicz, Z.: Genetic algorithms, numerical optimization and constraints. In: Eshelman, L.J. (eds) Proceedings of the 6th International Conference on Genetic Algorithms, pp.\u00a0151\u20131580. Morgan Kaufman, San Mateo California (1995)"},{"key":"2109_CR19","doi-asserted-by":"crossref","unstructured":"Nu\u00f1ez, L., Regis, R.G., Varela, K.: Accelerated random search for constrained global optimization assisted by radial basis function surrogates. J. Comput. Appl. Math. 340, 276\u2013295 (2018)","DOI":"10.1016\/j.cam.2018.02.017"},{"key":"2109_CR20","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1007\/s11590-013-0631-8","volume":"8","author":"CJ Price","year":"2014","unstructured":"Price, C.J., Reale, M., Robertson, B.L.: One side cut accelerated random search: a direct search method for bound constrained global optimization. Optim. Lett. 8, 1137\u20131148 (2014)","journal-title":"Optim. Lett."},{"key":"2109_CR21","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10898-015-0388-y","volume":"65","author":"CJ Price","year":"2016","unstructured":"Price, C.J., Reale, M., Robertson, B.L.: Stochastic filter methods for generally constrained global optimization. J. Glob. Optim. 65, 441\u2013456 (2016)","journal-title":"J. Glob. Optim."},{"key":"2109_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10898-020-00928-6","volume":"79","author":"CJ Price","year":"2021","unstructured":"Price, C.J., Reale, M., Robertson, B.L.: OSCARS-II: an algorithm for bound constrained global optimization. J. Glob. Optim. 79, 39\u201357 (2021)","journal-title":"J. Glob. Optim."},{"key":"2109_CR23","doi-asserted-by":"crossref","unstructured":"Regis, R.G.: A hybrid surrogate assisted accelerated random search and trust region approach for constrained black-box optimization. In: Lecture Notes in Computer Science 13164, pp. 162\u2013177. Springer, Cham (2022)","DOI":"10.1007\/978-3-030-95470-3_12"},{"key":"2109_CR24","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10898-014-0157-3","volume":"60","author":"AMAC Rocha","year":"2014","unstructured":"Rocha, A.M.A.C., Costa, M.F.P., Fernandes, E.M.G.P.: A filter-based fish swarm algorithm for constrained global optimization: theoretical and practical issues. J. Glob. Opt. 60, 239\u2013263 (2014)","journal-title":"J. Glob. Opt."},{"key":"2109_CR25","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s10898-004-0570-0","volume":"31","author":"RG Regis","year":"2005","unstructured":"Regis, R.G., Shoemaker, C.A.: Constrained global optimization of expensive black box functions using radial basis functions. J. Glob. Opt. 31, 153\u2013171 (2005)","journal-title":"J. Glob. Opt."},{"key":"2109_CR26","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/4235.873238","volume":"4","author":"TP Runarsson","year":"2000","unstructured":"Runarsson, T.P., Yao, X.: Stochastic ranking for constrained evolutionary optimization. IEEE Trans. Evol. Comput. 4, 284\u2013294 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"2109_CR27","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/s40314-021-01562-y","volume":"40","author":"PR Sampaio","year":"2021","unstructured":"Sampaio, P.R.: DEFT-FUNNEL: an open-source global optimization solver for constrained grey-box and black-box problems. Comput. Appl. Math. 40, 176\u2013211 (2021)","journal-title":"Comput. Appl. Math."},{"key":"2109_CR28","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01096734","volume":"3","author":"F Schoen","year":"1993","unstructured":"Schoen, F.: A wide class of test functions for global optimization. J. Glob. Optim. 3, 133\u2013137 (1993)","journal-title":"J. Glob. Optim."},{"key":"2109_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100653","volume":"54","author":"P Spettel","year":"2020","unstructured":"Spettel, P., Beyer, H.-G.: Matrix adaptation evolution strategies for optimization under nonlinear equality constraints. Swarm Evol. Comput. 54, 100653 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"2109_CR30","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1002\/nme.2451","volume":"77","author":"Y Wang","year":"2009","unstructured":"Wang, Y., Cai, Z., Zhou, Y.: Accelerating adaptive trade-off model using shrinking space technique for constrained evolutionary optimization. Int. J. Numer. Methods Eng. 77, 1501\u20131534 (2009)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"2109_CR31","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.ins.2021.02.055","volume":"566","author":"P Xu","year":"2021","unstructured":"Xu, P., Luo, W., Lin, X., Qiao, Y.: Evolutionary continuous constrained optimization using random direction repair. Inf. Sci. 566, 80\u2013102 (2021)","journal-title":"Inf. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02109-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02109-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02109-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T10:02:50Z","timestamp":1736935370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02109-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,31]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["2109"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02109-w","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,3,31]]},"assertion":[{"value":"27 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 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 that there are no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest:"}}]}}