{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,9]],"date-time":"2026-10-09T18:58:17Z","timestamp":1791572297603,"version":"4.3.4"},"reference-count":40,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/100008074","name":"Grainger Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008074","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1545046"],"award-info":[{"award-number":["CNS-1545046"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11347"],"award-info":[{"award-number":["DE-AC02-06CH11347"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:p>We study solution sensitivity for nonlinear programs (NLPs) whose structures are induced by graphs. These NLPs arise in many applications such as dynamic optimization, stochastic optimization, optimization with partial differential equations, and network optimization. We show that for a given pair of nodes, the sensitivity of the primal-dual solution at one node against a data perturbation at the other node decays exponentially with respect to the distance between these two nodes on the graph. In other words, the solution sensitivity decays as one moves away from the perturbation point. This result, which we call exponential decay of sensitivity, holds under the strong second-order sufficiency condition and the linear independence constraint qualification. We also present conditions under which the decay rate remains uniformly bounded; this allows us to characterize the sensitivity behavior of NLPs defined over subgraphs of infinite graphs. The theoretical developments are illustrated with numerical examples.<\/jats:p>","DOI":"10.1137\/21m1391079","type":"journal-article","created":{"date-parts":[[2022,5,31]],"date-time":"2022-05-31T12:16:26Z","timestamp":1653999386000},"page":"1156-1183","source":"Crossref","is-referenced-by-count":27,"title":["Exponential Decay of Sensitivity in Graph-Structured Nonlinear Programs"],"prefix":"10.1137","volume":"32","author":[{"given":"Sungho","family":"Shin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mihai","family":"Anitescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Victor M.","family":"Zavala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2022,5,31]]},"reference":[{"key":"atypb2","unstructured":"S. Babaeinejadsarookolaee, A. Birchfield, R. D. Christie, C. Coffrin, C. DeMarco, R. Diao, M. Ferris, S. Fliscounakis, S. Greene, R. Huang, et al.\n                      The Power Grid Library for Benchmarking AC Optimal Power Flow Algorithms\n                      , arXiv preprint, arXiV:1908.02288 [math. OC], 2019,https:\/\/arxiv.org\/abs\/1908.02788."},{"key":"atypb3","doi-asserted-by":"crossref","unstructured":"D. S. Bernstein,\n                      Matrix Mathematics: Theory, Facts, and Formulas\n                      , Princeton University Press, 2009.","DOI":"10.1515\/9781400833344"},{"key":"atypb4","doi-asserted-by":"crossref","unstructured":"J. T. Betts,\n                      Practical Methods for Optimal Control and Estimation Using Nonlinear Programming\n                      , SIAM, Philadesphia, 2010.","DOI":"10.1137\/1.9780898718577"},{"key":"atypb5","doi-asserted-by":"crossref","unstructured":"L. T. Biegler,\n                      Nonlinear Programming: Concepts, Algorithms, and Applications to Chemical Processes\n                      , SIAM, Philadesphia, 2010.","DOI":"10.1137\/1.9780898719383"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.3182\/20131218-3-IN-2045.00191"},{"key":"atypb7","first-page":"3","author":"Biegler L. T.","year":"2003","journal-title":"Cham"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2016.2616385"},{"key":"atypb9","unstructured":"J. F. Bonnans and A. Shapiro,\n                      Perturbation Analysis of Optimization Problems\n                      , Springer Science & Business Media, New York, 2013."},{"key":"atypb10","unstructured":"J. Cochran, M. Miller, O. Zinaman, M. Milligan, D. Arent, B. Palmintier, M. O'Malley, S. Mueller, E. Lannoye, A. Tuohy, et al.\n                      Flexibility in21st Century Power Systems\n                      , tech. report, National Renewable Energy Lab. (NREL), Golden, CO, 2014."},{"key":"atypb11","first-page":"1","author":"Coffrin C.","year":"2018","journal-title":"IEEE"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.3.353"},{"key":"atypb13","doi-asserted-by":"crossref","unstructured":"S. Demko, W. F. Moss, and P. W. Smith,\n                      Decay rates for inverses of band matrices\n                      , Math. comp., 43 (1984), pp. 491-499.","DOI":"10.1090\/S0025-5718-1984-0758197-9"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/S0959-1524(01)00023-3"},{"key":"atypb15","doi-asserted-by":"crossref","unstructured":"A. L. Dontchev and R. T. Rockafellar,\n                      Implicit Functions and Solution Mappings\n                      , Springer, Cham, 2009.","DOI":"10.1007\/978-0-387-87821-8"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580677"},{"key":"atypb17","unstructured":"G. H. Golub and C. F. Van Loan,\n                      Matrix Computations\n                      , Sohns Hopkins University, Press, Baltimore, MD, 2012."},{"key":"atypb18","unstructured":"I. E. Grossmann and M. Morari,\n                      Operability, Resiliency, and Flexibility: Process Design Objectives for a Changing World\n                      , tech. report DRC-06-55-83, Chemical Engineering Department, University of Wisconsin, Madison, 1983."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/18M1223083"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1051\/cocv\/2021030"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jde.2019.11.064"},{"key":"atypb22","unstructured":"R. A. Horn and C. R. Johnson,\n                      Matrix Analysis\n                      , Cambridge University Press, Cambridge, UK, 2012."},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.03.009"},{"key":"atypb24","first-page":"93","author":"Kojima M.","year":"1980","journal-title":"Elsevier"},{"key":"atypb25","doi-asserted-by":"publisher","DOI":"10.1137\/19M1265065"},{"key":"atypb26","unstructured":"S. Na and M. Anitescu,\n                      Superconvergence of Online Optimization for Model Predictive Control\n                      , arXiv preprint, arXiv:2001.03707 [Math. OC], 2020,https:\/\/arxiv.org\/abs\/2001.03707."},{"key":"atypb27","unstructured":"S. Na, S. Shin, M. Anitescu, and V. M. Zavala,\n                      On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control\n                      , 2022,https:\/\/arxiv.org\/abs\/2005.06674."},{"key":"atypb28","unstructured":"J. Nocedal and S. Wright,\n                      Numerical Optimization\n                      , Springer Science & Business Media, New York, 2006."},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1109\/TSTE.2015.2410760"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"M. V. Pereira and L. M. Pinto,\n                      Multi-stage stochastic optimization applied to energy planning\n                      , Math. program., 52 (1991), pp. 359-375.","DOI":"10.1007\/BF01582895"},{"key":"atypb31","doi-asserted-by":"crossref","unstructured":"S. M. Robinson,\n                      Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms\n                      , Math. program., 7 (1974), pp. 1-16.","DOI":"10.1007\/BF01585500"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1287\/moor.5.1.43"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"A. Shapiro, D. Dentcheva, and A. Ruszczy\u0144ski,\n                      Lectures on Stochastic Programming: Modeling and Theory\n                      , SIAM, Philadephia, 2014.","DOI":"10.1137\/1.9781611973433"},{"key":"atypb34","doi-asserted-by":"crossref","unstructured":"S. Shin, M. Anitescu, and V. M. Zavala,\n                      Overlapping Schwarz decomposition for constrained quadratic programs\n                      , in 2020 59th IEEE Conference on Decision and Control (CDC), 2020, pp. 3004-3009,https:\/\/ieeexplore.ieee.org\/document\/9304139.","DOI":"10.1109\/CDC42340.2020.9304139"},{"key":"atypb35","doi-asserted-by":"crossref","unstructured":"S. Shin, T. Faulwasser, M. Zanon, and V. M. Zavala,\n                      A parallel decomposition scheme for solving long-horizon optimal control problems\n                      , in Proceeding of the IEEE 58th Conference on Decision and Control (CDC), 2019, pp. 5264-5271.","DOI":"10.1109\/CDC40024.2019.9030139"},{"key":"atypb36","unstructured":"S. Shin and V. M. Zavala,\n                      Diffusing-horizon model predictive control\n                      , IEEE Trans. Automat. Control, in Press."},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2020.2967805"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1002\/aic.690310412"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/16M1081993"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2010.02.033"},{"key":"atypb41","first-page":"4563","author":"Zlotnik A.","year":"2015","journal-title":"IEEE"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/21M1391079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:55:51Z","timestamp":1787338551000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/21M1391079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,31]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["10.1137\/21M1391079"],"URL":"https:\/\/doi.org\/10.1137\/21m1391079","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,31]]}}}