{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:24:41Z","timestamp":1787340281795,"version":"3.56.0"},"reference-count":73,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61473185"],"award-info":[{"award-number":["61473185"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>This paper is about distributed derivative-based algorithms for solving optimization problems with a separable (potentially nonconvex) objective function and coupled affine constraints. A parallelizable method is proposed that combines ideas from the fields of sequential quadratic programming and augmented Lagrangian algorithms. The method negotiates shared dual variables that may be interpreted as prices, a concept employed in dual decomposition methods and the alternating direction method of multipliers (ADMM). Here, each agent solves its own small-scale nonlinear programming problem and communicates with other agents by solving coupled quadratic programming problems. These coupled quadratic programming problems have equality constraints for which parallelizable methods are available. The use of techniques associated with standard sequential quadratic programming methods gives a method with superlinear or quadratic convergence rate under suitable conditions. This is in contrast to existing decomposition methods, such as ADMM, which have a linear convergence rate. It is shown how the proposed algorithm may be extended using globalization techniques that guarantee convergence to a local minimizer from any initial starting point.<\/jats:p>","DOI":"10.1137\/140975991","type":"journal-article","created":{"date-parts":[[2016,5,3]],"date-time":"2016-05-03T14:45:30Z","timestamp":1462286730000},"page":"1101-1127","source":"Crossref","is-referenced-by-count":178,"title":["An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization"],"prefix":"10.1137","volume":"26","author":[{"given":"Boris","family":"Houska","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Janick","family":"Frasch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moritz","family":"Diehl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,5,3]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1137\/060654797"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00937167"},{"key":"atypb3","unstructured":"D. P. Bertsekas,\n                      Constrained Optimization and Lagrange Multiplier Methods\n                      , Academic Press, New York, 1982."},{"key":"atypb4","unstructured":"D. P. Bertsekas and J. N. Tsitsiklis,\n                      Parallel and Distributed Computation: Numerical Methods\n                      , Prentice-Hall, Englewood Cliffs, NJ, 1989."},{"key":"atypb5","unstructured":"D. P. Bertsekas,\n                      Nonlinear Programming\n                      , 2nd ed., Athena Scientific, Belmont, MA, 1999."},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492900002518"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"J. F. Bonnans and A. Shapiro,\n                      Perturbation Analysis of Optimization Problems\n                      , Springer, Heidelberg, 2000.","DOI":"10.1007\/978-1-4612-1394-9"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"S. Boyd and L. Vandenberghe,\n                      Convex Optimization\n                      , Cambridge University Press, Cambridge, UK, 2004.","DOI":"10.1017\/CBO9780511804441"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2008.10.002"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120945"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01582566"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1155\/1996\/483083"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2009.2013035"},{"key":"atypb15","unstructured":"G. Cohen,\n                      Decomposition et coordination en optimisation deterministe, differentiable et non differentiable\n                      , These d'etat, University Paris Dauphine, France, 1984."},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585100"},{"key":"atypb17","unstructured":"A. R. Conn, N. I. M. Gould, and P. L. Toint,\n                      LANCELOT: A FORTRAN Package for Large-Scale Nonlinear Optimization\n                      (Release A), Springer Ser. Comput. Math. 17, Springer-Verlag, New York, 1992."},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1080\/10556780903027500"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581204"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.10.2.218"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.3.399"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1007\/s00607-004-0083-1"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.1251"},{"key":"atypb24","unstructured":"H. J. Ferreau, A. Kozma, and M. Diehl,\n                      A parallel active-set strategy to solve sparse parametric quadratic programs arising in MPC\n                      , in Proceedings of the 4th IFAC Nonlinear Model Predictive Control Conference, 2012."},{"key":"atypb25","doi-asserted-by":"crossref","unstructured":"J. V. Frasch, S. Sager, and M. Diehl,\n                      A parallel quadratic program. method for dynamic optimization problems\n                      , Math. Program. Comput., 2015, Doi: 10.1007\/s12532-015-0081-7.","DOI":"10.1007\/s12532-015-0081-7"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623402419789"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(76)90003-1"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623499350013"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-010-9339-1"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1137\/120882913"},{"key":"atypb32","doi-asserted-by":"crossref","unstructured":"P. Giselsson and A. Rantzer,\n                      Distributed model predictive control with suboptimality and stability guarantees\n                      , in Proceedings of the 49th IEEE Conference on Decision and Control (CDC), 2010.","DOI":"10.1109\/CDC.2010.5717026"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.01.009"},{"key":"atypb34","first-page":"41","volume":"9","author":"Glowinski R.","year":"1975","journal-title":"Rev. Francaise Automati. Inform. Recherche Oper."},{"key":"atypb35","unstructured":"T. Goldstein, B. O'Donoghue, and S. Setzer,\n                      Fast Alternating Direction Optimization Methods\n                      , Tech. report, Department of Mathematics, University of California, Los Angeles, 2012."},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1145\/962437.962438"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1007\/BF00932858"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1007\/BF00927673"},{"key":"atypb40","first-page":"96","volume":"34","author":"Houska B.","year":"2012","journal-title":"Optimal Control Appl. Methods"},{"key":"atypb41","first-page":"11","volume":"8","author":"Iusem A.","year":"1999","journal-title":"Investigacio\u0301n Operativa"},{"key":"atypb42","doi-asserted-by":"crossref","unstructured":"A. Kozma, J. Frasch, and M. Diehl,\n                      A distributed method for convex quadratic programming problems arising in optimal control of distributed systems\n                      , in Proceedings of the 52nd IEEE Conference on Decision and Control, 2013, pp. 1526-1531.","DOI":"10.1109\/CDC.2013.6760099"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2014.911298"},{"key":"atypb44","first-page":"73","author":"Lemaire B.","year":"1989","journal-title":"Basel"},{"key":"atypb45","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623493246045"},{"key":"atypb46","unstructured":"N. Maratos,\n                      Exact Penaly Function Algorithms for Finite-Dimensional and Control Optimization Problems\n                      , Ph.D. thesis, Imperial College, London, 1978."},{"key":"atypb47","doi-asserted-by":"publisher","DOI":"10.1007\/BF01460116"},{"key":"atypb48","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2007159"},{"key":"atypb49","doi-asserted-by":"crossref","unstructured":"I. Necoara, D. Doan, and J. A. K. Suykens,\n                      Application of the proximal center decomposition method to distributed model predictive control\n                      , in Proceedings of the 47th IEEE Conference on Decision and Control, 2008, pp. 2900-2905.","DOI":"10.1109\/CDC.2008.4738765"},{"key":"atypb50","doi-asserted-by":"crossref","unstructured":"I. Necoara, C. Savorgnan, Q. Tran Dinh, J. A. K. Suykens, and M. Diehl,\n                      Distributed nonlinear optimal control using sequential convex programming and smoothing techniques\n                      , in Proceedings of the 48th IEEE Conference on Decision and Control, 2009, pp. 543-548.","DOI":"10.1109\/CDC.2009.5399597"},{"key":"atypb51","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9566-8"},{"key":"atypb52","unstructured":"J. Nocedal and S. J. Wright,\n                      Numerical Optimization\n                      , 2nd ed., Springer Ser. Oper. Res. Financ. Eng. Springer, New York, 2006."},{"key":"atypb53","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2012.2231960"},{"key":"atypb54","first-page":"123","volume":"1","author":"Parikh N.","year":"2013","journal-title":"Found Trends Optim."},{"key":"atypb55","unstructured":"M. J. D. Powell,\n                      A method for nonlinear constraints in minimization problems\n                      , in Optimization, R. Fletcher, ed., Academic Press, New York, 1969."},{"key":"atypb56","first-page":"144","volume":"1977","author":"M. J.","journal-title":"Berlin"},{"key":"atypb57","first-page":"27","volume":"3","author":"M. J.","year":"1978","journal-title":"Nonlinear Program."},{"key":"atypb58","doi-asserted-by":"crossref","unstructured":"A. Rantzer,\n                      Dynamic dual decomposition for distributed control\n                      , in Proceedings of the 2009 American Control Conference, 2009 pp. 884-888.","DOI":"10.1109\/ACC.2009.5160224"},{"key":"atypb59","doi-asserted-by":"crossref","unstructured":"S. Richter, M. Morari, and C. N. Jones,\n                      Towards computational complexity certification for constrained MPC based on Lagrange relaxation and the fast gradient method\n                      , in Proceedings of the 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC), 2011.","DOI":"10.1109\/CDC.2011.6160931"},{"key":"atypb60","unstructured":"R. T. Rockafellar,\n                      Convex Analysis\n                      , Princeton Math. Ser., 28, Princeton University Press, Princeton. 1970."},{"key":"atypb61","doi-asserted-by":"publisher","DOI":"10.1016\/j.apnum.2009.07.009"},{"key":"atypb62","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0103"},{"key":"atypb63","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0115-7"},{"key":"atypb64","doi-asserted-by":"publisher","DOI":"10.1007\/BF00933339"},{"key":"atypb65","first-page":"1","author":"Song F.","year":"2009","journal-title":"New York"},{"key":"atypb66","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1985.1103899"},{"key":"atypb67","first-page":"125","author":"Tapia R. A.","year":"1978","journal-title":"New York"},{"key":"atypb68","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940031"},{"key":"atypb69","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1977-0455338-4"},{"key":"atypb70","doi-asserted-by":"publisher","DOI":"10.1137\/11085311X"},{"key":"atypb71","doi-asserted-by":"crossref","unstructured":"Q. Tran Dinh, I. Necoara, and M. Diehl,\n                      A dual decomposition algorithm for separable nonconvex optimization using the penalty function framework\n                      , in Proceedings of the 52nd IEEE Conference on Decision and Control, 2013, pp. 2372-2377.","DOI":"10.1109\/CDC.2013.6760235"},{"key":"atypb72","unstructured":"H. Uzawa,\n                      Iterative methods for concave programming\n                      , in Studies in Linear and Nonlinear Programming, K. Arrow, L. Hurwicz, and H. Uzawa, eds., 1958, Stanford University Press, Stanford, CA, pp. 154-165."},{"key":"atypb73","doi-asserted-by":"crossref","unstructured":"H. Uzawa,\n                      Market mechanisms and mathematical programming\n                      , Econometrica, J., 28 (1960), pp. 872-881.","DOI":"10.2307\/1907569"},{"key":"atypb74","doi-asserted-by":"publisher","DOI":"10.1007\/BF00933211"},{"key":"atypb75","unstructured":"R. B. Wilson,\n                      A Simplicial Algorithm for Concave Programming\n                      , Ph.D. thesis, Graduate School of Business Administration, Harvard University, 1963."}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/140975991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:28:07Z","timestamp":1787336887000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/140975991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":73,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/140975991"],"URL":"https:\/\/doi.org\/10.1137\/140975991","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}