{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T05:03:45Z","timestamp":1784869425734,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T00:00:00Z","timestamp":1781740800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"NSERC discovery grant","award":["RGPIN-2020-04448"],"award-info":[{"award-number":["RGPIN-2020-04448"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10957-026-03042-x","type":"journal-article","created":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T05:01:45Z","timestamp":1781758905000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A partitioned optimization framework for structure-aware problems"],"prefix":"10.1007","volume":"210","author":[{"given":"Charles","family":"Audet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6560-8453","authenticated-orcid":false,"given":"Pierre-Yves","family":"Bouchet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lo\u00efc","family":"Bourdin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,18]]},"reference":[{"key":"3042_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100011","volume":"9","author":"S Alarie","year":"2021","unstructured":"Alarie, S., Audet, C., Gheribi, A.E., Kokkolaras, M., Le Digabel, S.: Two Decades of Blackbox Optimization Applications. EURO Journal on Computational Optimization 9, 100011 (2021). https:\/\/doi.org\/10.1016\/j.ejco.2021.100011","journal-title":"EURO Journal on Computational Optimization"},{"key":"3042_CR2","doi-asserted-by":"crossref","unstructured":"Astudillo, R., Frazier, P.I.: Thinking Inside the Box: A Tutorial on Grey-Box Bayesian Optimization. In K.\u00a0Sojung, B.\u00a0Feng, K.\u00a0Smith, S.\u00a0Masoud, and Z.\u00a0Zheng, editors, 2021 Winter Simulation Conference, volume\u00a02, pages 1\u201315. IEEE, (2021)","DOI":"10.1109\/WSC52266.2021.9715343"},{"issue":"1","key":"3042_CR3","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E., Jr.: Mesh Adaptive Direct Search Algorithms for Constrained Optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006). https:\/\/doi.org\/10.1137\/040603371","journal-title":"SIAM J. Optim."},{"issue":"1","key":"3042_CR4","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis, J.E., Jr.: A Progressive Barrier for Derivative-Free Nonlinear Programming. SIAM J. Optim. 20(1), 445\u2013472 (2009). https:\/\/doi.org\/10.1137\/070692662","journal-title":"SIAM J. Optim."},{"key":"3042_CR5","doi-asserted-by":"publisher","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering. Springer, Cham, Switzerland, (2017). https:\/\/doi.org\/10.1007\/978-3-319-68913-5","DOI":"10.1007\/978-3-319-68913-5"},{"issue":"3","key":"3042_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3544489","volume":"48","author":"C Audet","year":"2022","unstructured":"Audet, C., Le Digabel, S., Rochon Montplaisir, V., Tribes, C.: Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm. ACM Transactions on Mathematical Software 48(3), 1 (2022). https:\/\/doi.org\/10.1145\/3544489","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"1","key":"3042_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s11590-024-02165-2","volume":"19","author":"C Audet","year":"2025","unstructured":"Audet, C., Bouchet, P.-Y., Bourdin, L.: Convergence Towards a Local Minimum by Direct Search Methods with a Covering Step. Optimization Letters 19(1), 211\u2013231 (2025). https:\/\/doi.org\/10.1007\/s11590-024-02165-2","journal-title":"Optimization Letters"},{"key":"3042_CR8","doi-asserted-by":"publisher","unstructured":"Bayen, T., Pfeiffer, L.: Second Order Conditions for a Control Problem with Discontinuous Cost. In R.\u00a0Sepulchre and C.\u00a0Prieur, editors, 2019 IEEE 58th Conference on Decision and Control, pages 1480\u20131485, (2019). https:\/\/doi.org\/10.1109\/CDC40024.2019.9029314","DOI":"10.1109\/CDC40024.2019.9029314"},{"issue":"1","key":"3042_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01197708","volume":"17","author":"AJ Booker","year":"1999","unstructured":"Booker, A.J., Dennis, J.E., Jr., Frank, P.D., Serafini, D.B., Torczon, V., Trosset, M.W.: A Rigorous Framework for Optimization of Expensive Functions by Surrogates. Struct. Multidiscip. Optim. 17(1), 1\u201313 (1999). https:\/\/doi.org\/10.1007\/BF01197708","journal-title":"Struct. Multidiscip. Optim."},{"key":"3042_CR10","unstructured":"Bouchet, P.-Y.: Th\u00e9orie de l\u2019Optimisation Sans D\u00e9riv\u00e9es dans le Cas Discontinu. PhD thesis, Polytechnique Montr\u00e9al, (2023). https:\/\/publications.polymtl.ca\/56997\/"},{"key":"3042_CR11","unstructured":"Bouchet, P.-Y., Audet, C., Bourdin, L.: A Derivative-Free Approach to Optimal Control Problems with Piecewise Constant Mayer Cost Function, (2021). https:\/\/arxiv.org\/abs\/2112.00413"},{"key":"3042_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/9781009166164","author":"N Boumal","year":"2023","unstructured":"Boumal, N.: Introduction to Optimization on Smooth Manifolds. Cambridge University Press (2023). https:\/\/doi.org\/10.1017\/9781009166164. (https:\/\/www.nicolasboumal.net\/book\/)","journal-title":"Cambridge University Press"},{"issue":"2","key":"3042_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10107-017-1137-4","volume":"169","author":"C Cartis","year":"2018","unstructured":"Cartis, C., Scheinberg, K.: Global Convergence Rate Analysis of Unconstrained Optimization Methods Based on Probabilistic Models. Math. Program. 169(2), 337\u2013375 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1137-4","journal-title":"Math. Program."},{"key":"3042_CR14","doi-asserted-by":"publisher","unstructured":"Clarke, F.H.: Functional Analysis, Calculus of Variations and Optimal Control. Graduate Texts in Mathematics. Springer London, (2013). https:\/\/doi.org\/10.1007\/978-1-4471-4820-3","DOI":"10.1007\/978-1-4471-4820-3"},{"key":"3042_CR15","doi-asserted-by":"publisher","unstructured":"Constantine, P.G.: Active Subspaces. Society for Industrial and Applied Mathematics, Philadelphia, PA, (2015). https:\/\/doi.org\/10.1137\/1.9781611973860","DOI":"10.1137\/1.9781611973860"},{"key":"3042_CR16","doi-asserted-by":"publisher","unstructured":"Dempe, S., Zemkoho, A.: Bilevel Optimization. Number 978-3-030-52119-6 in Optimization and Its Applications. Springer, 09 (2020). https:\/\/doi.org\/10.1007\/978-3-030-52119-6","DOI":"10.1007\/978-3-030-52119-6"},{"key":"3042_CR17","unstructured":"Diouane, Y., Kungurtsev, V., Rinaldi, F., Zeffiro, D.: Inexact Direct-Search Methods for Bilevel Optimization Problems, (2023). https:\/\/arxiv.org\/abs\/2307.09924"},{"key":"3042_CR18","unstructured":"Dzahini, K.J., Wild, S.M.: Stochastic Trust-Region Algorithm in Random Subspaces with Convergence and Expected Complexity Analyses, (2022). https:\/\/arxiv.org\/abs\/2207.06452"},{"key":"3042_CR19","unstructured":"Feinberg, E.A., Kasyanov, P.O., Kraemer, D.N.: Continuity of Parametric Optima for Possibly Discontinuous Functions and Noncompact Decision Sets, (2021). https:\/\/arxiv.org\/abs\/2109.06299"},{"issue":"3","key":"3042_CR20","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct Search Based on Probabilistic Descent. SIAM J. Optim. 25(3), 1515\u20131541 (2015). https:\/\/doi.org\/10.1137\/140961602","journal-title":"SIAM J. Optim."},{"key":"3042_CR21","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10898-020-00952-6","volume":"79","author":"DR Jones","year":"2021","unstructured":"Jones, D.R., Martins, J.R.R.A.: The DIRECT Algorithm: 25 Years Later. J. Global Optim. 79, 521\u2013566 (2021). https:\/\/doi.org\/10.1007\/s10898-020-00952-6","journal-title":"J. Global Optim."},{"issue":"1","key":"3042_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-023-00245-5","volume":"16","author":"J Larson","year":"2024","unstructured":"Larson, J., Menickelly, M.: Structure-Aware Methods for Expensive Derivative-Free Nonsmooth Composite Optimization. Math. Program. Comput. 16(1), 1\u201336 (2024). https:\/\/doi.org\/10.1007\/s12532-023-00245-5","journal-title":"Math. Program. Comput."},{"key":"3042_CR23","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free Optimization Methods. Acta Numer 28, 287\u2013404 (2019). https:\/\/doi.org\/10.1017\/S0962492919000060","journal-title":"Acta Numer"},{"issue":"4","key":"3042_CR24","doi-asserted-by":"publisher","first-page":"2638","DOI":"10.1137\/20M1378089","volume":"31","author":"J Larson","year":"2021","unstructured":"Larson, J., Menickelly, M., Zhou, B.: Manifold Sampling for Optimizing Nonsmooth Nonconvex Compositions. SIAM J. Optim. 31(4), 2638\u20132664 (2021). https:\/\/doi.org\/10.1137\/20M1378089","journal-title":"SIAM J. Optim."},{"key":"3042_CR25","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10898-009-9515-y","volume":"48","author":"G Liuzzi","year":"2010","unstructured":"Liuzzi, G., Lucidi, S., Piccialli, V.: A Partition-Based Global Optimization Algorithm. J. Global Optim. 48, 113\u2013128 (2010). https:\/\/doi.org\/10.1007\/s10898-009-9515-y","journal-title":"J. Global Optim."},{"key":"3042_CR26","doi-asserted-by":"publisher","unstructured":"Mordukhovich, B.S.: Bilevel Optimization and Variational Analysis, pages 197\u2013226. Springer International Publishing, Cham, (2020). ISBN 978-3-030-52119-6. https:\/\/doi.org\/10.1007\/978-3-030-52119-6_7","DOI":"10.1007\/978-3-030-52119-6_7"},{"key":"3042_CR27","doi-asserted-by":"publisher","DOI":"10.1201\/9780203749319","author":"LS Pontryagin","year":"1962","unstructured":"Pontryagin, L.S., Boltyanskii, V.G., Gamkrelidze, R.V., Mischenko, E.F.: The Mathematical Theory of Optimal Processes. Taylor & Francis Group (1962). https:\/\/doi.org\/10.1201\/9780203749319","journal-title":"Taylor & Francis Group"},{"issue":"1","key":"3042_CR28","first-page":"497","volume":"135","author":"AV Rao","year":"2009","unstructured":"Rao, A.V.: A survey of numerical methods for optimal control. Adv. Astronaut. Sci. 135(1), 497\u2013528 (2009)","journal-title":"Adv. Astronaut. Sci."},{"issue":"4","key":"3042_CR29","doi-asserted-by":"publisher","first-page":"3057","DOI":"10.1137\/22M1488569","volume":"33","author":"L Roberts","year":"2023","unstructured":"Roberts, L., Royer, C.W.: Direct Search Based on Probabilistic Descent in Reduced Spaces. SIAM J. Optim. 33(4), 3057\u20133082 (2023). https:\/\/doi.org\/10.1137\/22M1488569","journal-title":"SIAM J. Optim."},{"issue":"2","key":"3042_CR30","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1287\/moor.16.2.292","volume":"16","author":"SM Robinson","year":"1991","unstructured":"Robinson, S.M.: An Implicit-Function Theorem for a Class of Nonsmooth Functions. Math. Oper. Res. 16(2), 292\u2013309 (1991). https:\/\/doi.org\/10.1287\/moor.16.2.292","journal-title":"Math. Oper. Res."},{"issue":"2","key":"3042_CR31","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/j.ejor.2024.03.020","volume":"320","author":"U Sadana","year":"2025","unstructured":"Sadana, U., Chenreddy, A., Delage, E., Forel, A., Frejinger, E., Vidal, T.: A Survey of Contextual Optimization Methods for Decision-Making under Uncertainty. Eur. J. Oper. Res. 320(2), 271\u2013289 (2025). https:\/\/doi.org\/10.1016\/j.ejor.2024.03.020. (ISSN 0377-2217)","journal-title":"Eur. J. Oper. Res."},{"key":"3042_CR32","doi-asserted-by":"publisher","unstructured":"Sethi, S.: Optimal Control Theory: Applications to Management Science and Economics. Springer Texts in Business and Economics. Springer New York, (2021). https:\/\/doi.org\/10.1007\/978-3-030-91745-6","DOI":"10.1007\/978-3-030-91745-6"},{"key":"3042_CR33","doi-asserted-by":"publisher","unstructured":"Stefanov, S.M.: Separable Optimization. Springer Optimization and Its Applications. Springer, Cham, Switzerland, (2021). https:\/\/doi.org\/10.1007\/978-3-030-78401-0","DOI":"10.1007\/978-3-030-78401-0"},{"key":"3042_CR34","unstructured":"Still, G.: Lectures on Parametric Optimization: An Introduction. Optimization Online, (2018). URL https:\/\/optimization-online.org\/?p=15154"},{"key":"3042_CR35","unstructured":"Verma, S., Boonsanong, V., Hoang, M., Hines, K.E., Dickerson, J.P., Shah, C.: Counterfactual Explanations and Algorithmic Recourses for Machine Learning: A Review, (2022). https:\/\/arxiv.org\/abs\/2010.10596"},{"key":"3042_CR36","doi-asserted-by":"publisher","unstructured":"Vinter, R.: Optimal Control. Modern Birkh\u00e4user Classics. Birkh\u00e4user, Boston, MA, (2010). https:\/\/doi.org\/10.1007\/978-0-8176-8086-2","DOI":"10.1007\/978-0-8176-8086-2"},{"key":"3042_CR37","unstructured":"Vivier-Ardisson, G., Forel, A., Parmentier, A., Vidal, T.: CF-OPT: Counterfactual Explanations for Structured Prediction, (2024). https:\/\/arxiv.org\/abs\/2405.18293"},{"issue":"4","key":"3042_CR38","doi-asserted-by":"publisher","first-page":"1224","DOI":"10.1080\/10618600.2021.1874962","volume":"30","author":"N Wycoff","year":"2021","unstructured":"Wycoff, N., Binois, M., Wild, S.M.: Sequential Learning of Active Subspaces. J. Comput. Graph. Stat. 30(4), 1224\u20131237 (2021). https:\/\/doi.org\/10.1080\/10618600.2021.1874962","journal-title":"J. Comput. Graph. Stat."},{"key":"3042_CR39","unstructured":"Zhang, Z.: PRIMA: Reference Implementation for Powell\u2019s Methods with Modernization and Amelioration, (2023). http:\/\/www.libprima.net"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03042-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-03042-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-03042-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T04:51:13Z","timestamp":1784868673000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-03042-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,18]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["3042"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-03042-x","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,18]]},"assertion":[{"value":"16 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"9"}}