{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T00:40:05Z","timestamp":1749948005736,"version":"3.41.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T00:00:00Z","timestamp":1486166400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100006132","name":"Office of Science","doi-asserted-by":"publisher","award":["DE-SC0010615"],"award-info":[{"award-number":["DE-SC0010615"]}],"id":[{"id":"10.13039\/100006132","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10589-017-9895-8","type":"journal-article","created":{"date-parts":[[2017,2,4]],"date-time":"2017-02-04T16:56:17Z","timestamp":1486227377000},"page":"317-360","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Solving nearly-separable quadratic optimization problems as nonsmooth equations"],"prefix":"10.1007","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7214-9187","authenticated-orcid":false,"given":"Frank E.","family":"Curtis","sequence":"first","affiliation":[]},{"given":"Arvind U.","family":"Raghunathan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,4]]},"reference":[{"key":"9895_CR1","doi-asserted-by":"crossref","unstructured":"Bai, L., Raghunathan, A.\u00a0U.: Semismooth equation approach to network utility maximization (NUM). In American Control Conference (ACC), pp. 4795\u20134801, (2013)","DOI":"10.1109\/ACC.2013.6580580"},{"key":"9895_CR2","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9895_CR3","volume-title":"Convex Optimization Theory","author":"DP Bertsekas","year":"2009","unstructured":"Bertsekas, D.P.: Convex Optimization Theory. Athena Scientific, Belmont (2009)"},{"key":"9895_CR4","volume-title":"Introduction to Stochastic Programming","author":"JR Birge","year":"1997","unstructured":"Birge, J.R., Louveaux, F.V.: Introduction to Stochastic Programming. Springer, New York (1997)"},{"issue":"2","key":"9895_CR5","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s11081-011-9141-7","volume":"13","author":"C Bragalli","year":"2012","unstructured":"Bragalli, C., Ambrosio, C.D., Lee, J., Lodi, A., Toth, P.: On the optimal design of water distribution networks: a practical MINLP approach. Opt. Eng. 13(2), 219\u2013246 (2012)","journal-title":"Opt. Eng."},{"key":"9895_CR6","first-page":"159","volume":"70","author":"D Ralph","year":"1995","unstructured":"Ralph, D., Dempe, S.: Directional derivatives of the solution of a parametric nonlinear program. Math. Prog. 70, 159\u2013172 (1995)","journal-title":"Math. Prog."},{"key":"9895_CR7","unstructured":"Deng, W., Lai, M.-J., Peng, Z., Yin, W.: Parallel Multi-Block ADMM with $$o(1\/k)$$ Convergence. Technical report, arXiv:1312.3040 (2014)"},{"issue":"1","key":"9895_CR8","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10898-013-0085-7","volume":"59","author":"QT Dinh","year":"2014","unstructured":"Dinh, Q.T., Necoara, I., Diehl, M.: Path-following gradient-based decomposition algorithms for separable convex optimization. J. Global Optim. 59(1), 59\u201380 (2014)","journal-title":"J. Global Optim."},{"issue":"1","key":"9895_CR9","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/11085311X","volume":"23","author":"QT Dinh","year":"2013","unstructured":"Dinh, Q.T., Necoara, I., Savorgnan, C., Diehl, M.: An inexact perturbed path-following method for lagrangian decomposition in large-scale separable convex optimization. SIAM J. Optim. 23(1), 95\u2013125 (2013)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9895_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10589-012-9515-6","volume":"55","author":"QT Dinh","year":"2013","unstructured":"Dinh, Q.T., Savorgnan, C., Diehl, M.: Combining lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems. Comput. Optim. Appl. 55(1), 75\u2013111 (2013)","journal-title":"Comput. Optim. Appl."},{"key":"9895_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/S1052623496298194","volume":"8","author":"F Facchinei","year":"1998","unstructured":"Facchinei, F., Fischer, A., Kanzow, C.: Regularity properties of a semismooth reformulation of variational inequalities. SIAM J. Optim. 8, 850\u2013869 (1998)","journal-title":"SIAM J. Optim."},{"key":"9895_CR12","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/S1052623494279110","volume":"7","author":"F Facchinei","year":"1997","unstructured":"Facchinei, F., Soares, J.: A new merit function for nonlinear complementarity problems and a related algorithm. SIAM J. Optim. 7, 225\u2013247 (1997)","journal-title":"SIAM J. Optim."},{"key":"9895_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/BF01580677","volume":"10","author":"AV Fiacco","year":"1976","unstructured":"Fiacco, A.V.: Sensitivity analysis for nonlinear programming using penalty methods. Math. Program. 10, 287\u2013311 (1976)","journal-title":"Math. Program."},{"key":"9895_CR14","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear programming: sequential unconstrained minimization techniques. Class. Appl. Math. Soc. Ind. Appl. Math. (1987)"},{"key":"9895_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1080\/02331939208843795","volume":"24","author":"A Fischer","year":"1992","unstructured":"Fischer, A.: A special Newton-type optimization method. Optimization 24, 269\u2013284 (1992)","journal-title":"Optimization"},{"key":"9895_CR16","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1137\/S1052623499357258","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Gould, N.I.M., Leyffer, S., Toint, PhL, W\u00e4chter, A.: Global convergence of trust-region SQP-filter algorithms for nonlinear programming. SIAM J. Opt. 13, 635\u2013659 (2002)","journal-title":"SIAM J. Opt."},{"key":"9895_CR17","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s101070100244","volume":"91","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239\u2013269 (2002)","journal-title":"Math. Program."},{"key":"9895_CR18","doi-asserted-by":"crossref","unstructured":"Fletcher, R., Leyffer, S.: Filter-type algorithms for solving systems of algebraic equations and inequalities. In: High-Performance Algorithms and Software in Nonlinear Optimization, pp. 259\u2013278. Kluwer, Dordrecht, The Netherlands (2003)","DOI":"10.1007\/978-1-4613-0241-4_12"},{"key":"9895_CR19","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S105262340038081X","volume":"13","author":"R Fletcher","year":"2002","unstructured":"Fletcher, R., Leyffer, S., Toint, PhL: On the global convergence of a filter-SQP algorithm. SIAM J. Opt. 13, 44\u201359 (2002)","journal-title":"SIAM J. Opt."},{"issue":"3","key":"9895_CR20","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s12532-015-0081-7","volume":"7","author":"JV Frasch","year":"2015","unstructured":"Frasch, J.V., Sager, S., Diehl, M.: A parallel quadratic programming method for dynamic optimization problems. Math. Prog. Comput. 7(3), 289\u2013329 (2015)","journal-title":"Math. Prog. Comput."},{"issue":"1","key":"9895_CR21","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10479-006-0139-z","volume":"152","author":"J Gondzio","year":"2007","unstructured":"Gondzio, J., Grothey, A.: Parallel interior-point solver for structured quadratic programs: Application to financial planning problems. Ann. Oper. Res. 152(1), 319\u2013339 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9895_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1137\/S1052623403422637","volume":"15","author":"NIM Gould","year":"2004","unstructured":"Gould, N.I.M., Leyffer, S., Toint, PhL: A multidimensional filter algorithm for nonlinear equations and nonlinear least squares. SIAM J. Opt. 15, 17\u201338 (2004)","journal-title":"SIAM J. Opt."},{"key":"9895_CR23","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1137\/S0363012994276494","volume":"35","author":"H Jiang","year":"1997","unstructured":"Jiang, H., Qi, L.: A new nonsmooth equations approach to nonlinear complementarity problems. SIAM J Control Opt. 35, 178\u2013193 (1997)","journal-title":"SIAM J Control Opt."},{"issue":"5","key":"9895_CR24","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1080\/10556780701296455","volume":"22","author":"C Kanzow","year":"2007","unstructured":"Kanzow, C., Petra, S.: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems. Opt. Methods Softw. 22(5), 713\u2013735 (2007)","journal-title":"Opt. Methods Softw."},{"key":"9895_CR25","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01581275","volume":"58","author":"L Qi","year":"1993","unstructured":"Qi, L., Sun, J.: A nonsmooth version of Newton\u2019s method. Math. Progr. 58, 353\u2013368 (1993)","journal-title":"Math. Progr."},{"key":"9895_CR26","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-79409-7_22","volume-title":"Modeling, simulation and optimization of complex processes","author":"CD Laird","year":"2008","unstructured":"Laird, C.D., Biegler, L.T.: Large-scale nonlinear programming for multi-scenario optimization. In: Bock, H.G., Kostina, E., Phu, H.X., Ranacher, R. (eds.) Modeling, simulation and optimization of complex processes, pp. 323\u2013336. Springer, Berlin (2008)"},{"key":"9895_CR27","first-page":"407","volume":"75","author":"T De Luca","year":"1996","unstructured":"De Luca, T., Facchinei, F., Kanzow, C.: A semismooth equation approach to the solution of nonlinear complementarity problems. Math. Progr. 75, 407\u2013439 (1996)","journal-title":"Math. Progr."},{"key":"9895_CR28","volume-title":"Microeconomic Theory","author":"A Mas-Colell","year":"1991","unstructured":"Mas-Colell, A., Whinston, M.D., Green, J.R.: Microeconomic Theory. Oxford University Press, Oxford (1991)"},{"key":"9895_CR29","first-page":"294","volume":"13","author":"TS Munson","year":"2001","unstructured":"Munson, T.S., Facchinei, F., Ferris, M., Fischer, A., Kanzow, C.: The Semismooth algorithm for large scale complementarity problems. J. Comput. 13, 294\u2013311 (2001)","journal-title":"J. Comput."},{"issue":"3","key":"9895_CR30","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1080\/10556788.2016.1161763","volume":"31","author":"I Necoara","year":"2016","unstructured":"Necoara, I., Patrascu, A.: Iteration complexity analysis of dual first-order methods for conic convex programming. Opt. Methods Softw. 31(3), 645\u2013678 (2016)","journal-title":"Opt. Methods Softw."},{"issue":"11","key":"9895_CR31","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"Necoara, I., Suykens, J.A.K.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"11","key":"9895_CR32","doi-asserted-by":"publisher","first-page":"2674","DOI":"10.1109\/TAC.2008.2007159","volume":"53","author":"I Necoara","year":"2008","unstructured":"Necoara, I., Suykens, J.A.K.: Application of a smoothing technique to decomposition in convex optimization. IEEE Trans. Autom. Control 53(11), 2674\u20132679 (2008)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"9895_CR33","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1007\/s10957-009-9566-8","volume":"143","author":"I Necoara","year":"2009","unstructured":"Necoara, I., Suykens, J.A.K.: Interior-point lagrangian decomposition method for separable convex optimization. J. Optim. Theory Appl. 143(3), 567\u2013588 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"9895_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston (2004)"},{"issue":"1","key":"9895_CR35","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1137\/S1052623403422285","volume":"16","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Excessive gap technique in nonsmooth convex minimization. SIAM J Opt. 16(1), 235\u2013249 (2005)","journal-title":"SIAM J Opt."},{"issue":"1","key":"9895_CR36","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Progr. (A) 103(1), 127\u2013152 (2005)","journal-title":"Math. Progr. (A)"},{"key":"9895_CR37","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Algorithms in Convex Programming","author":"Y Nesterov","year":"1994","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (SIAM Studies in Applied Mathematics), Philadelphia (1994)"},{"key":"9895_CR38","unstructured":"Neumaier, A.: MINQ\u2014General Definite and Bound Constrained Indefinite Quadratic Programming (1998)"},{"issue":"9","key":"9895_CR39","doi-asserted-by":"publisher","first-page":"2134","DOI":"10.1016\/j.camwa.2007.08.037","volume":"55","author":"Pu-yan Nie","year":"2008","unstructured":"Nie, Pu-yan, Lai, Ming yong, Zhu, Shu jin, Zhang, Pei ai: A line search filter approach for the system of nonlinear equations. Comput. Math. Appl. 55(9), 2134\u20132141 (2008)","journal-title":"Comput. Math. Appl."},{"key":"9895_CR40","first-page":"101","volume":"51","author":"L Qi","year":"1991","unstructured":"Qi, L.: Convergence analysis of some algorithms for solving nonsmooth equations. Math. Oper. Res. 51, 101\u2013131 (1991)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"9895_CR41","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/0315061","volume":"15","author":"R Mifflin","year":"1977","unstructured":"Mifflin, R.: Semismooth and semiconvex functions in constrained optimization. SIAM J. Control Opt. 15(6), 959\u2013972 (1977)","journal-title":"SIAM J. Control Opt."},{"key":"9895_CR42","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719000","volume-title":"The Linear Complementarity Problem. Classics in Applied Mathematics","author":"RW Cottle","year":"2009","unstructured":"Cottle, R.W., Pang, J.-S., Stone, R.E.: The Linear Complementarity Problem. Classics in Applied Mathematics. SIAM, Philadelphia (2009)"},{"issue":"1","key":"9895_CR43","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/110827387","volume":"23","author":"AU Raghunathan","year":"2013","unstructured":"Raghunathan, A.U.: Global optimization of nonlinear network design. SIAM J. Optim. 23(1), 268\u2013295 (2013)","journal-title":"SIAM J. Optim."},{"key":"9895_CR44","doi-asserted-by":"crossref","unstructured":"Raghunathan, A.\u00a0U., Curtis, F.\u00a0E., Takaguchi, Y., Hashimoto, H.: Accelerating convergence to competitive equilibrium in electricity markets. In: IEEE Power & Energy Society General Meeting, PESGM2016-000221 (2016)","DOI":"10.1109\/PESGM.2016.7741162"},{"issue":"5","key":"9895_CR45","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"RT Rockafellar","year":"1976","unstructured":"Rockafellar, R.T.: Monotone Operators and the Proximal Point Algorithm. SIAM J. Control Optim. 14(5), 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"9895_CR46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82118-9","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"1985","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions. Springer, New York (1985)"},{"issue":"2","key":"9895_CR47","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1023\/A:1008705425484","volume":"16","author":"T De Luca","year":"2000","unstructured":"De Luca, T., Facchinei, F., Kanzow, C.: A theoretical and numerical comparison of some semismooth algorithms for complementarity problems. Comput. Opt. Appl. 16(2), 173\u2013205 (2000)","journal-title":"Comput. Opt. Appl."},{"issue":"2","key":"9895_CR48","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s10107-003-0477-4","volume":"100","author":"M Ulbrich","year":"2004","unstructured":"Ulbrich, M., Ulbrich, S., Vicente, L.N.: A globally convergent primal-dual interior-point filter method for nonlinear programming. Math. Progr. 100(2), 379\u2013410 (2004)","journal-title":"Math. Progr."},{"issue":"1","key":"9895_CR49","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"9895_CR50","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-1-4614-1605-0_2","volume-title":"Control and Optimization Methods for Electric Smart Grids, volume\u00a03 of Power Electronics and Power Systems","author":"G Wang","year":"2012","unstructured":"Wang, G., Negrete-Pincetic, M., Kowli, A., Shafieepoorfard, E., Meyn, S., Shanbhag, U.V.: Dynamic competitive equilibria in electricity markets. In: Chakrabortty, Aranya, Ili, Marija D. (eds.) Control and Optimization Methods for Electric Smart Grids, volume\u00a03 of Power Electronics and Power Systems, pp. 35\u201362. Springer, New York (2012)"},{"key":"9895_CR51","volume-title":"Power Generation Operation and Control","author":"AJ Wood","year":"1996","unstructured":"Wood, A.J., Wollenberg, B.F.: Power Generation Operation and Control, 2nd edn. Wiley, Hoboken (1996)","edition":"2"},{"issue":"19","key":"9895_CR52","doi-asserted-by":"publisher","first-page":"4834","DOI":"10.1016\/j.ces.2007.05.022","volume":"63","author":"VM Zavala","year":"2008","unstructured":"Zavala, V.M., Laird, C.D., Biegler, L.T.: Interior-point decomposition approaches for parallel solution of large-scale nonlinear parameter estimation problems. Chem. Eng. Sci. 63(19), 4834\u20134845 (2008)","journal-title":"Chem. Eng. Sci."},{"issue":"1","key":"9895_CR53","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-Sanchez, C.E., Thomas, R.J.: MATPOWER: steady-state operations, planning and analysis tools for power systems research and education. IEEE Trans. Power Syst. 26(1), 12\u201319 (2011)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9895-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9895-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9895-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T00:11:12Z","timestamp":1749946272000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9895-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,4]]},"references-count":53,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9895"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9895-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2017,2,4]]},"assertion":[{"value":"23 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}