{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T07:41:12Z","timestamp":1774597272983,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T00:00:00Z","timestamp":1625011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004434","name":"Universit\u00e0 degli Studi di Firenze","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004434","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In the present paper we propose to rewrite a nonsmooth problem subjected to convex constraints as an unconstrained problem. We show that this novel formulation shares the same global and local minima with the original constrained problem. Moreover, the reformulation can be solved with standard nonsmooth optimization methods if we are able to make projections onto the feasible sets. Numerical evidence shows that the proposed formulation compares favorably against state-of-art approaches. Code can be found at <jats:ext-link xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" ext-link-type=\"uri\" xlink:href=\"https:\/\/github.com\/jth3galv\/dfppm\">https:\/\/github.com\/jth3galv\/dfppm<\/jats:ext-link>.<\/jats:p>","DOI":"10.1007\/s10589-021-00296-1","type":"journal-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T09:02:55Z","timestamp":1625043775000},"page":"33-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0384-0334","authenticated-orcid":false,"given":"Giulio","family":"Galvan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Sciandrone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Lucidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,30]]},"reference":[{"issue":"2","key":"296_CR1","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1137\/080716980","volume":"20","author":"M Abramson","year":"2009","unstructured":"Abramson, M., Audet, C., Dennis, J., Digabel, S.: Orthomads: a deterministic mads instance with orthogonal directions. SIAM J. Optim. 20(2), 948\u2013966 (2009)","journal-title":"SIAM J. Optim."},{"key":"296_CR2","doi-asserted-by":"crossref","unstructured":"Abramson, M.A., Brezhneva, O.A., Jr., Pingel: Pattern search in the presence of degenerate linear constraints. Optim. Methods Softw. 23(3), 297\u2013319 (2008)","DOI":"10.1080\/10556780701521670"},{"issue":"4","key":"296_CR3","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/060671267","volume":"18","author":"C Audet","year":"2008","unstructured":"Audet, C., Cust\u00f3dio, A., Dennis, J.: Erratum: mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 18(4), 1501\u20131503 (2008)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"296_CR4","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"296_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1137\/070692662","volume":"20","author":"C Audet","year":"2009","unstructured":"Audet, C., Dennis, J.: A progressive barrier for derivative-free nonlinear programming. SIAM J. Optim. 20(1), 445\u2013472 (2009)","journal-title":"SIAM J. Optim."},{"key":"296_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68913-5","volume-title":"Derivative-Free and Blackbox Optimization","author":"C Audet","year":"2017","unstructured":"Audet, C., Hare, W.: Derivative-Free and Blackbox Optimization. Springer Series in Operations Research and Financial Engineering. Springer International Publishing, Cham, Switzerland (2017)"},{"key":"296_CR7","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1995)"},{"issue":"3","key":"296_CR8","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10898-016-0433-5","volume":"66","author":"P Beyhaghi","year":"2016","unstructured":"Beyhaghi, P., Bewley, T.R.: Delaunay-based derivative-free optimization via global surrogates, part ii: convex constraints. J. Global Optim. 66(3), 383\u2013415 (2016)","journal-title":"J. Global Optim."},{"key":"296_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, F.: Optimization and Nonsmooth Analysis. Society for Industrial and Applied Mathematics (1990)","DOI":"10.1137\/1.9781611971309"},{"issue":"3","key":"296_CR10","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/130940037","volume":"24","author":"G Fasano","year":"2014","unstructured":"Fasano, G., Liuzzi, G., Lucidi, S., Rinaldi, F.: A linesearch-based derivative-free approach for nonsmooth constrained optimization. SIAM J. Optim. 24(3), 959\u2013992 (2014)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"296_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF00939550","volume":"56","author":"L Grippo","year":"1988","unstructured":"Grippo, L., Lampariello, F., Lucidi, S.: Global convergence and stabilization of unconstrained minimization methods without derivatives. J. Optim. Theory Appl. 56(3), 385\u2013406 (1988)","journal-title":"J. Optim. Theory Appl."},{"key":"296_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-48320-2","volume-title":"Test Examples for Nonlinear Programming Codes","author":"W Hock","year":"1981","unstructured":"Hock, W., Schittkowski, K.: Test Examples for Nonlinear Programming Codes. Springer-Verlag, Berlin, Heidelberg (1981)"},{"issue":"2","key":"296_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/321062.321069","volume":"8","author":"R Hooke","year":"1961","unstructured":"Hooke, R., Jeeves, T.A.: \u201cdirect search\u201d solution of numerical and statistical problems. J. ACM 8(2), 212\u2013229 (1961)","journal-title":"J. ACM"},{"key":"296_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03271-8","volume-title":"Introduction to the Theory of Nonlinear Optimization","author":"J Jahn","year":"1996","unstructured":"Jahn, J.: Introduction to the Theory of Nonlinear Optimization. Springer, Berlin Heidelberg (1996)"},{"issue":"4","key":"296_CR15","doi-asserted-by":"publisher","first-page":"1","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), 1\u201315 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"296_CR16","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/S1052623496300507","volume":"9","author":"R Lewis","year":"1999","unstructured":"Lewis, R., Torczon, V.: Pattern search algorithms for bound constrained minimization. SIAM J. Optim. 9(4), 1082\u20131099 (1999)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"296_CR17","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1137\/S1052623497331373","volume":"10","author":"R Lewis","year":"2000","unstructured":"Lewis, R., Torczon, V.: Pattern search methods for linearly constrained minimization. SIAM J. Optim. 10(3), 917\u2013941 (2000)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"296_CR18","doi-asserted-by":"publisher","first-page":"1075","DOI":"10.1137\/S1052623498339727","volume":"12","author":"R Lewis","year":"2002","unstructured":"Lewis, R., Torczon, V.: A globally convergent augmented lagrangian pattern search algorithm for optimization with general constraints and simple bounds. SIAM J. Optim. 12(4), 1075\u20131089 (2002)","journal-title":"SIAM J. Optim."},{"issue":"5","key":"296_CR19","doi-asserted-by":"publisher","first-page":"2614","DOI":"10.1137\/090750639","volume":"20","author":"G Liuzzi","year":"2010","unstructured":"Liuzzi, G., Lucidi, S., Sciandrone, M.: Sequential penalty derivative-free methods for nonlinear constrained optimization. SIAM J. Optim. 20(5), 2614\u20132635 (2010)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"296_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1013735414984","volume":"21","author":"S Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M.: A derivative-free algorithm for bound constrained optimization. Comput. Optim. Appl. 21(2), 119\u2013142 (2002)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"296_CR21","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/S1052623497330392","volume":"13","author":"S Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M.: On the global convergence of derivative-free methods for unconstrained optimization. SIAM J. Optim. 13(1), 97\u2013116 (2002)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"296_CR22","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s101070100266","volume":"92","author":"S Lucidi","year":"2002","unstructured":"Lucidi, S., Sciandrone, M., Tseng, P.: Objective-derivative-free methods for constrained optimization. Math. Program. 92(1), 37\u201359 (2002)","journal-title":"Math. Program."},{"key":"296_CR23","unstructured":"Luk\u0161an, L., Vlcek, J.: Test problems for nonsmooth unconstrained and linearly constrained optimization. Technick\u00e1 zpr\u00e1va 798,(2000)"},{"issue":"1","key":"296_CR24","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1137\/080724083","volume":"20","author":"J Mor\u00e9","year":"2009","unstructured":"Mor\u00e9, J., Wild, S.: Benchmarking derivative-free optimization algorithms. SIAM J. Optim. 20(1), 172\u2013191 (2009)","journal-title":"SIAM J. Optim."},{"key":"296_CR25","unstructured":"naught101: Sobol random generation code. Software available at https:\/\/github.com\/naught101\/sobol_seq (2017)"},{"key":"296_CR26","volume-title":"More Test Examples for Nonlinear Programming Codes","year":"1987","unstructured":"Schittkowski, K. (ed.): More Test Examples for Nonlinear Programming Codes. Springer-Verlag, Berlin, Heidelberg (1987)"},{"issue":"5","key":"296_CR27","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0041-5553(76)90154-3","volume":"16","author":"I Sobol","year":"1976","unstructured":"Sobol, I.: Uniformly distributed sequences with an additional uniform property. USSR Comput. Math. Math. Phys. 16(5), 236\u2013242 (1976)","journal-title":"USSR Comput. Math. Math. Phys."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00296-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00296-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00296-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,31]],"date-time":"2021-07-31T17:21:36Z","timestamp":1627752096000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00296-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,30]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["296"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00296-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,30]]},"assertion":[{"value":"1 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}