{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:23:20Z","timestamp":1787340200372,"version":"build-2736575974"},"reference-count":68,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["188264188\/GRK1754"],"award-info":[{"award-number":["188264188\/GRK1754"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2020,1]]},"abstract":"<jats:p>We consider distributionally robust optimization problems (DROPs) with nonlinear and nonconcave dependence on uncertain parameters. The DROP can be written as a nonsmooth, nonlinear program with a bilevel structure; the objective function and each of the constraint functions are suprema of expected values of parametric functions taken over an ambiguity set of probability distributions. We define ambiguity sets through moment constraints, and to make the computation of first order stationary points tractable, we approximate nonlinear functions using quadratic expansions w.r.t. parameters, resulting in lower-level problems defined by trust-region problems and semidefinite programs. Subsequently, we construct smoothing functions for the approximate lower level functions which are computationally tractable, employing strong duality for trust-region problems, and show that gradient consistency holds. We formulate smoothed DROPs and apply a homotopy method that dynamically decreases smoothing parameters and establish its convergence to stationary points of the approximate DROP under mild assumptions. Through our scheme, we provide a new approach to robust nonlinear optimization as well. We perform numerical experiments and comparisons to other methods on a well-known test set, assuming design variables are subject to implementation errors, which provides a representative set of numerical examples.<\/jats:p>","DOI":"10.1137\/19m1263121","type":"journal-article","created":{"date-parts":[[2020,7,30]],"date-time":"2020-07-30T15:15:55Z","timestamp":1596122155000},"page":"1996-2025","source":"Crossref","is-referenced-by-count":6,"title":["An Approximation Scheme for Distributionally Robust Nonlinear Optimization"],"prefix":"10.1137","volume":"30","author":[{"given":"Johannes","family":"Milz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Ulbrich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2020,7,30]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1080\/02331930903578700"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0750-8"},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal, L. El Ghaoui, and A. Nemirovski,\n                      Robust Optimization\n                      , Princeton Ser. Appl. Math., Princeton University Press, Princeton, NJ, 2009.","DOI":"10.1515\/9781400831050"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011380"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal and A. Nemirovski,\n                      Lectures on Modern Convex Optimization\n                      , MPS-SIAM Ser. Optim. 2, SIAM, Philadelphia, 2001,https:\/\/doi.org\/10.1137\/1.9780898718829.","DOI":"10.1137\/1.9780898718829"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592331"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1137\/080734510"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1090.0319"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0715"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1137\/141000671"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"J. F. Bonnans and A. Shapiro,\n                      Perturbation Analysis of Optimization Problems\n                      , Springer Ser. Oper. Res., Springer Science & Business Media, New York, 2000,https:\/\/doi.org\/10.1007\/978-1-4612-1394-9.","DOI":"10.1007\/978-1-4612-1394-9"},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe,\n                      Convex Optimization\n                      , Cambridge University Press, Cambridge, 2004,https:\/\/doi.org\/10.1017\/CBO9780511804441.","DOI":"10.1017\/CBO9780511804441"},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"V. V. Buldygin and Y. V. Kozachenko,\n                      Metric Characterization of Random Variables and Random Processes\n                      , Transl. Math. Monogr. 188, American Mathematical Society, Providence, RI, 2000.","DOI":"10.1090\/mmono\/188"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/120889812"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-016-0362-y"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s11228-013-0235-6"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1137\/030601296"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0569-0"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-004-8271-2"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1799"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1975-0367131-6"},{"key":"atypb22","doi-asserted-by":"crossref","unstructured":"F. H. Clarke,\n                      Optimization and Nonsmooth Analysis\n                      , Classics Appl. Math. 5, SIAM, Philadelphia, 1990,https:\/\/doi.org\/10.1137\/1.9781611971309.","DOI":"10.1137\/1.9781611971309"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0741"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0685-1"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-012-9920-5"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-017-1172-1"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02055196"},{"key":"atypb28","unstructured":"J. Fiala, M. Ko\u010dvara, and M. Stingl,\n                      PENLAB: A MATLAB Solver for Nonlinear Semidefinite Optimization\n                      , preprint,https:\/\/arxiv.org\/abs\/1311.5240, 2013."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144502414942"},{"key":"atypb30","unstructured":"R. Gao and A. J. Kleywegt,\n                      Distributionally Robust Stochastic Optimization with Wasserstein Distance\n                      , preprint,https:\/\/arxiv.org\/abs\/1604.02199, 2016."},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0795"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/1015073"},{"key":"atypb33","unstructured":"R. A. Horn and C. R. Johnson,\n                      Matrix Analysis\n                      , 2nd ed., Cambridge University Press, Cambridge, 2013,https:\/\/doi.org\/10.1017\/9781139020411."},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0591-2"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0667"},{"key":"atypb36","unstructured":"N. Karmitsa,\n                      Solver-o-matic\n                      ,http:\/\/napsu.karmitsa.fi\/solveromatic\/, 2012, accessed September 12, 2019."},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2010.526116"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-018-9388-3"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/16M108269X"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1287\/moor.21.3.576"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107980004a"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0514-2"},{"key":"atypb43","unstructured":"M. M. M\u00e4kel\u00e4,\n                      Multiobjective Proximal Bundle Method for Nonconvex Nonsmooth Optimization: Fortran Subroutine MPBNGC 2.0\n                      , Reports of the Department of Mathematical Information Technology, Series B, Scientific Computing B 13\/2003, University of Jyv\u00e4skyl\u00e4, Jyv\u00e4skyl\u00e4, 2003."},{"key":"atypb44","first-page":"191","author":"M\u00e4kel\u00e4 M. M.","year":"2016","journal-title":"Cham"},{"key":"atypb45","doi-asserted-by":"crossref","unstructured":"M. M. M\u00e4kel\u00e4 and P. Neittaanm\u00e4ki,\n                      Nonsmooth Optimization: Analysis and Algorithms with Applications to Optimal Control\n                      , World Scientific Singapore, Singapore, 1992,https:\/\/doi.org\/10.1142\/1493.","DOI":"10.1142\/1493"},{"key":"atypb46","doi-asserted-by":"publisher","DOI":"10.1145\/355934.355936"},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1137\/0904038"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0001-8"},{"key":"atypb49","doi-asserted-by":"crossref","unstructured":"Yu. Nesterov and A. Nemirovski,\n                      Interior-Point Polynomial Algorithms in Convex Programming\n                      , SIAM Stud. Appl. Math. 13, SIAM, Philadelphia, 1994,https:\/\/doi.org\/10.1137\/1.9781611970791.","DOI":"10.1137\/1.9781611970791"},{"key":"atypb50","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-016-0892-3"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOTA.0000006685.60019.3e"},{"key":"atypb52","unstructured":"J. Revels, M. Lubin, and T. Papamarkou,\n                      Forward-Mode Automatic Differentiation in Julia\n                      , preprint,https:\/\/arxiv.org\/abs\/1607.07892, 2016."},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1137\/16M1058297"},{"key":"atypb54","doi-asserted-by":"publisher","DOI":"10.1080\/1055678021000034008"},{"key":"atypb55","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0330-5"},{"key":"atypb56","doi-asserted-by":"publisher","DOI":"10.1137\/0719026"},{"key":"atypb57","doi-asserted-by":"publisher","DOI":"10.1137\/090748883"},{"key":"atypb58","doi-asserted-by":"publisher","DOI":"10.1137\/0805016"},{"key":"atypb59","first-page":"263","volume":"2","author":"Tao P. D.","year":"1995","journal-title":"J. Convex Anal."},{"key":"atypb60","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)90009-4"},{"key":"atypb61","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0559-y"},{"key":"atypb62","doi-asserted-by":"publisher","DOI":"10.1145\/3104990"},{"key":"atypb63","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1314"},{"key":"atypb64","doi-asserted-by":"publisher","DOI":"10.1137\/140971580"},{"key":"atypb65","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2011.05.010"},{"key":"atypb66","doi-asserted-by":"publisher","DOI":"10.15807\/jorsj.58.24"},{"key":"atypb67","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-006-9082-z"},{"key":"atypb68","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2018.01.011"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/19M1263121","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:24:04Z","timestamp":1787336644000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/19M1263121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1]]},"references-count":68,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["10.1137\/19M1263121"],"URL":"https:\/\/doi.org\/10.1137\/19m1263121","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1]]}}}