{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:38:58Z","timestamp":1740145138851,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T00:00:00Z","timestamp":1668297600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s11590-022-01950-1","type":"journal-article","created":{"date-parts":[[2022,11,13]],"date-time":"2022-11-13T09:03:51Z","timestamp":1668330231000},"page":"561-589","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9924-2082","authenticated-orcid":false,"given":"Jeffrey","family":"Larson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0710-4377","authenticated-orcid":false,"given":"Misha","family":"Padidar","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6099-2772","authenticated-orcid":false,"given":"Stefan M.","family":"Wild","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,13]]},"reference":[{"key":"1950_CR1","unstructured":"Le Digabel, S., Wild, S.M.: A taxonomy of constraints in black-box simulation-based optimization. Preprint ANL\/MCS-P5350-0515, Argonne National Laboratory, MCS (2015). http:\/\/www.mcs.anl.gov\/papers\/P5350-0515.pdf"},{"key":"1950_CR2","unstructured":"Hallock, T.L.: Model-based trust region algorithms for derivative-free optimization with unrelaxable constraints. PhD thesis, University of Colorado at Denver (2021). https:\/\/www.proquest.com\/dissertations-theses\/model-based-trust-region-algorithms-derivative\/docview\/2618487117\/se-2?accountid=147023"},{"key":"1950_CR3","unstructured":"Hough, M., Roberts, L.: Model-based derivative-free methods for convex-constrained optimization. Technical Report 2111.05443, ArXiv (2021). https:\/\/arxiv.org\/abs\/2111.05443"},{"issue":"9","key":"1950_CR4","doi-asserted-by":"publisher","first-page":"3329","DOI":"10.1109\/TIP.2013.2264817","volume":"22","author":"N Stefanoski","year":"2013","unstructured":"Stefanoski, N., Wang, O., Lang, M., Greisen, P., Heinzle, S., Smolic, A.: Automatic view synthesis by image-domain-warping. IEEE Trans. Image Process. 22(9), 3329\u20133341 (2013)","journal-title":"IEEE Trans. Image Process."},{"key":"1950_CR5","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, New York, NY (2006)","edition":"2"},{"issue":"1","key":"1950_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10589-021-00296-1","volume":"80","author":"G Galvan","year":"2021","unstructured":"Galvan, G., Sciandrone, M., Lucidi, S.: A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints. Comput. Optim. Appl. 80(1), 33\u201353 (2021)","journal-title":"Comput. Optim. Appl."},{"key":"1950_CR7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971309","volume-title":"Optimization and Nonsmooth Analysis","author":"FH Clarke","year":"1990","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Society for Industrial and Applied Mathematics, Philadelphia, PA (1990)"},{"key":"1950_CR8","doi-asserted-by":"crossref","unstructured":"Gould, N.I.M., Orban, D., Toint, P.L.: CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization. Computational Optimization and Applications, 1\u201313 (2014). Code available at http:\/\/ccpforge.cse.rl.ac.uk\/gf\/project\/cutest\/wiki","DOI":"10.1007\/s10589-014-9687-3"},{"issue":"4","key":"1950_CR9","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw."},{"key":"1950_CR10","unstructured":"Powell, M.J.D.: The BOBYQA algorithm for bound constrained optimization without derivatives. Technical Report DAMTP 2009\/NA06, University of Cambridge (2009). http:\/\/www.damtp.cam.ac.uk\/user\/na\/NA_papers\/NA2009_06.pdf"},{"key":"1950_CR11","volume-title":"Constrained Optimization and Lagrange Multiplier Methods","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Constrained Optimization and Lagrange Multiplier Methods. Academic Press, New York, NY (1982)"},{"key":"1950_CR12","doi-asserted-by":"crossref","unstructured":"Plantenga, T.D.: HOPSPACK 2.0 user manual. Technical Report SAND2009-6265, Sandia National Laboratories (2009). https:\/\/dakota.sandia.gov\/sites\/default\/files\/HopspackUserManual_2_0_2.pdf","DOI":"10.2172\/1000278"},{"issue":"4","key":"1950_CR13","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/1916461.1916468","volume":"37","author":"S Le Digabel","year":"2011","unstructured":"Le Digabel, S.: Algorithm 909: NOMAD: Nonlinear optimization with the MADS algorithm. ACM Trans. Math. Softw. 37(4), 44\u201314415 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"1950_CR14","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-642-11339-0_4","volume-title":"Interior point methods for nonlinear optimization","author":"I P\u00f3lik","year":"2010","unstructured":"P\u00f3lik, I., Terlaky, T.: Interior point methods for nonlinear optimization, pp. 215\u2013276. Nonlinear Optimization, Springer, Berlin (2010)"},{"key":"1950_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718812","volume-title":"A Mathematical View of Interior-Point Methods in Convex Optimization","author":"J Renegar","year":"2001","unstructured":"Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA (2001)"},{"issue":"1","key":"1950_CR16","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1950_CR17","volume-title":"Practical Methods of Optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. John Wiley & Sons, England (1987)","edition":"2"},{"key":"1950_CR18","volume-title":"LANCELOT: a Fortran Package for Large-scale Nonlinear Optimization (Release A)","author":"AR Conn","year":"2013","unstructured":"Conn, A.R., Gould, G., Toint, P.L.: LANCELOT: a Fortran Package for Large-scale Nonlinear Optimization (Release A). Springer, Berlin, Heidelberg (2013)"},{"issue":"4","key":"1950_CR19","first-page":"1980","volume":"24","author":"S Gratton","year":"2014","unstructured":"Gratton, S., Vicente, L.N.: A merit function approach for direct search. Soc. Ind. Appl. Math. J. Optim. 24(4), 1980\u20131998 (2014)","journal-title":"Soc. Ind. Appl. Math. J. Optim."},{"issue":"1","key":"1950_CR20","first-page":"445","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis, J.E., Jr.: A progressive barrier for derivative-free nonlinear programming. Soc. Ind. Appl. Math. J. Optim. 20(1), 445\u2013472 (2009)","journal-title":"Soc. Ind. Appl. Math. J. Optim."},{"issue":"1","key":"1950_CR21","first-page":"188","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh adaptive direct search algorithms for constrained optimization. Soc. Ind. Appl. Math. J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"Soc. Ind. Appl. Math. J. Optim."},{"issue":"1","key":"1950_CR22","first-page":"172","volume":"20","author":"JJ Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J.J., Wild, S.M.: Benchmarking derivative-free optimization algorithms. Soc. Ind. Appl. Math. J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"Soc. Ind. Appl. Math. J. Optim."},{"key":"1950_CR23","unstructured":"Johnson, S.G.: The NLopt nonlinear-optimization package (2019). http:\/\/github.com\/stevengj\/nlopt"},{"issue":"1","key":"1950_CR24","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1080\/10556788.2017.1378652","volume":"34","author":"N Keskar","year":"2019","unstructured":"Keskar, N., W\u00e4chter, A.: A limited-memory quasi-Newton algorithm for bound-constrained nonsmooth optimization. Optim. Methods Softw. 34(1), 150\u2013171 (2019)","journal-title":"Optim. Methods Softw."},{"key":"1950_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08114-4","volume-title":"Introduction to Nonsmooth Optimization: Theory. Practice and Software","author":"A Bagirov","year":"2014","unstructured":"Bagirov, A., Karmitsa, N., M\u00e4kel\u00e4, M.M.: Introduction to Nonsmooth Optimization: Theory. Practice and Software. Springer, Berlin, Heidelberg (2014)"},{"key":"1950_CR26","unstructured":"Padidar, M., Larson, J., Wild, S.: Online supplement to: Modeling approaches for addressing simple unrelaxable constraints with unconstrained optimization methods. Technical report. https:\/\/arxiv.org\/src\/2205.09627v2\/anc\/online_supplement.pdf"},{"key":"1950_CR27","doi-asserted-by":"crossref","unstructured":"Eldred, J.S., Larson, J., Padidar, M., Stern, E., Wild, S.M.: Derivative-free optimization of a rapid-cycling synchrotron. Optimization and Engineering (2022). (to appear)","DOI":"10.1007\/s11081-022-09733-4"},{"issue":"1","key":"1950_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41467-020-20314-w","volume":"12","author":"H Yang","year":"2021","unstructured":"Yang, H., S\u00fcrer, \u00d6zge., Duque, D., Morton, D.P., Singh, B., Fox, S.J., Pasco, R., Pierce, K., Rathouz, P., Valencia, V., Du, Z., Pignone, M., Escott, M.E., Adler, S.I., Johnston, S.C., Meyers, L.A.: Design of COVID-19 staged alert systems to ensure healthcare capacity with minimal closures. Nat Commun 12(1), 1\u20137 (2021)","journal-title":"Nat Commun"},{"key":"1950_CR29","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-68713-7","volume-title":"Introduction to Continuous Optimization","author":"RA Polyak","year":"2021","unstructured":"Polyak, R.A.: Introduction to Continuous Optimization, vol. 172. Springer, Berlin, Heidelberg (2021)"},{"key":"1950_CR30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge, England (2004)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01950-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01950-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01950-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,8]],"date-time":"2023-03-08T12:19:01Z","timestamp":1678277941000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01950-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,13]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1950"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01950-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,11,13]]},"assertion":[{"value":"16 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}