{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:53:07Z","timestamp":1773798787261,"version":"3.50.1"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T00:00:00Z","timestamp":1522368000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T00:00:00Z","timestamp":1522368000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000121","name":"Division of Mathematical Sciences","doi-asserted-by":"publisher","award":["DMS-16-2044"],"award-info":[{"award-number":["DMS-16-2044"]}],"id":[{"id":"10.13039\/100000121","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10107-018-1264-6","type":"journal-article","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T02:26:39Z","timestamp":1522376799000},"page":"173-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms"],"prefix":"10.1007","volume":"177","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5866-0787","authenticated-orcid":false,"given":"Quoc","family":"Tran-Dinh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianxiao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shu","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,30]]},"reference":[{"issue":"1\u20133","key":"1264_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1008607511915","volume":"12","author":"A Auslender","year":"1999","unstructured":"Auslender, A., Teboulle, M., Ben-Tiba, S.: A logarithmic-quadratic proximal method for variational inequalities. Comput. Optim. Appl. 12(1\u20133), 31\u201340 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"1264_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operators Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.: Convex Analysis and Monotone Operators Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"issue":"1","key":"1264_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1137\/080716542","volume":"2","author":"A Beck","year":"2009","unstructured":"Beck, A., Teboulle, M.: A fast iterative shrinkage-thresholding agorithm for linear inverse problems. SIAM J. Imaging Sci. 2(1), 183\u2013202 (2009)","journal-title":"SIAM J. Imaging Sci."},{"key":"1264_CR4","unstructured":"Becker, S., Fadili, M.J.: A quasi-Newton proximal splitting method. In: Proceedings of Neutral Information Processing Systems Foundation (NIPS) (2012)"},{"key":"1264_CR5","series-title":"Volume 3 of MPS\/SIAM Series on Optimization","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Volume 3 of MPS\/SIAM Series on Optimization. SIAM, Philadelphia (2001)"},{"key":"1264_CR6","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01204181","volume":"29","author":"JF Bonnans","year":"1994","unstructured":"Bonnans, J.F.: Local analysis of Newton-type methods for variational inequalities and nonlinear programming. Appl. Math. Optim. 29, 161\u2013186 (1994)","journal-title":"Appl. Math. Optim."},{"issue":"1","key":"1264_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000016","volume":"3","author":"S Boyd","year":"2011","unstructured":"Boyd, S., Parikh, N., Chu, E., Peleato, B., Eckstein, J.: Distributed optimization and statistical learning via the alternating direction method of multipliers. Found. Trends Mach. Learn. 3(1), 1\u2013122 (2011)","journal-title":"Found. Trends Mach. Learn."},{"key":"1264_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. University Press, Cambridge (2004)"},{"issue":"1","key":"1264_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s10851-010-0251-1","volume":"40","author":"A Chambolle","year":"2011","unstructured":"Chambolle, A., Pock, T.: A first-order primal-dual algorithm for convex problems with applications to imaging. J. Math. Imaging Vis. 40(1), 120\u2013145 (2011)","journal-title":"J. Math. Imaging Vis."},{"key":"1264_CR10","doi-asserted-by":"crossref","unstructured":"Combettes, P., Pesquet, J.-C.: Signal recovery by proximal forward-backward splitting. In: Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, Berlin (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"1264_CR11","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1137\/050626090","volume":"4","author":"PL Combettes","year":"2005","unstructured":"Combettes, P.L., Wajs, V.R.: Signal recovery by proximal forward\u2013backward splitting. Multiscale Model. Simul. 4, 1168\u20131200 (2005)","journal-title":"Multiscale Model. Simul."},{"issue":"3","key":"1264_CR12","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/BF02592192","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. Program. 75(3), 407\u2013439 (1996)","journal-title":"Math. Program."},{"key":"1264_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4939-1037-3","volume-title":"Implicit Functions and Solution Mappings: A View from Variational Analysis","author":"AL Dontchev","year":"2014","unstructured":"Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings: A View from Variational Analysis. Springer, Berlin (2014)"},{"key":"1264_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01581204","volume":"55","author":"J Eckstein","year":"1992","unstructured":"Eckstein, J., Bertsekas, D.: On the Douglas\u2013Rachford splitting method and the proximal point algorithm for maximal monotone operators. Math. Program. 55, 293\u2013318 (1992)","journal-title":"Math. Program."},{"key":"1264_CR15","unstructured":"Esser, J.E.: Primal-dual algorithm for convex models and applications to image restoration, registration and nonlocal inpainting. Ph.D. Thesis, University of California, Los Angeles (2010)"},{"key":"1264_CR16","volume-title":"Finite-Dimensional Variational Inequalities and Complementarity Problems","author":"F Facchinei","year":"2003","unstructured":"Facchinei, F., Pang, J.-S.: Finite-Dimensional Variational Inequalities and Complementarity Problems, vol. 1-2. Springer, Berlin (2003)"},{"key":"1264_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3, 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"key":"1264_CR18","first-page":"1","volume":"46","author":"M Friedlander","year":"2017","unstructured":"Friedlander, M., Goh, G.: Efficient evaluation of scaled proximal operators. Electron. Trans. Numer. Anal. 46, 1\u201322 (2017)","journal-title":"Electron. Trans. Numer. Anal."},{"key":"1264_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/BF01585696","volume":"53","author":"M Fukushima","year":"1992","unstructured":"Fukushima, M.: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems. Math. Program. 53, 99\u2013110 (1992)","journal-title":"Math. Program."},{"key":"1264_CR20","unstructured":"Goldstein, T., Li, M., Yuan, X., Esser, E., Baraniuk, R.: Adaptive primal-dual hybrid gradient methods for saddle-point problems, pp. 1\u201315 (2015). arXiv:1305.0546v2"},{"key":"1264_CR21","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications, pp. 155\u2013210. Springer, Berlin (2006)"},{"key":"1264_CR22","doi-asserted-by":"publisher","first-page":"2788","DOI":"10.1109\/TIT.2016.2546280","volume":"62","author":"B Hajek","year":"2016","unstructured":"Hajek, B., Wu, Y., Xu, J.: Achieving exact cluster recovery threshold via semidefinite programming. IEEE Trans. Inf. Theory 62, 2788\u20132797 (2016)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1264_CR23","unstructured":"Jaggi, M.: Revisiting Frank\u2013Wolfe: projection-free sparse convex optimization. In: JMLR W&CP, vol. 28, no. 1, pp. 427\u2013435 (2013)"},{"key":"1264_CR24","unstructured":"Johnson, R., Zhang, T.: Accelerating stochastic gradient descent using predictive variance reduction. In: Advances in Neural Information Processing Systems (NIPS), pp. 315\u2013323 (2013)"},{"issue":"4","key":"1264_CR25","first-page":"747","volume":"12","author":"GM Korpelevic","year":"1976","unstructured":"Korpelevic, G.M.: An extragradient method for finding saddle-points and for other problems. \u00c8kon. Mat. Metody 12(4), 747\u2013756 (1976)","journal-title":"\u00c8kon. Mat. Metody"},{"key":"1264_CR26","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1515\/9783112479926-011","volume":"45","author":"B Kummer","year":"1988","unstructured":"Kummer, B.: Newton\u2019s method for non-differentiable functions. Adv. Math. Optim. 45, 114\u2013125 (1988)","journal-title":"Adv. Math. Optim."},{"key":"1264_CR27","unstructured":"L\u00f6efberg, J.: YALMIP : a toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)"},{"issue":"3","key":"1264_CR28","doi-asserted-by":"publisher","first-page":"914","DOI":"10.1137\/11083085X","volume":"22","author":"RDC Monteiro","year":"2012","unstructured":"Monteiro, R.D.C., Svaiter, B.F.: Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems. SIAM J. Optim. 22(3), 914\u2013935 (2012)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1264_CR29","doi-asserted-by":"publisher","first-page":"1574","DOI":"10.1137\/070704277","volume":"19","author":"A Nemirovski","year":"2009","unstructured":"Nemirovski, A., Juditsky, A., Lan, G., Shapiro, A.: Robust stochastic approximation approach to stochastic programming. SIAM J. Optim. 19(4), 1574\u20131609 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1264_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovskii","year":"2004","unstructured":"Nemirovskii, A.: Prox-method with rate of convergence $${\\cal{O}}(1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex\u2013concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"key":"1264_CR31","series-title":"Volume 87 of Applied Optimization","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. Volume 87 of Applied Optimization. Kluwer Academic Publishers, Dordrecht (2004)"},{"issue":"2\u20133","key":"1264_CR32","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Dual extrapolation and its applications to solving variational inequalities and related problems. Math. Program. 109(2\u20133), 319\u2013344 (2007)","journal-title":"Math. Program."},{"issue":"2","key":"1264_CR33","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10107-006-0001-8","volume":"110","author":"Y Nesterov","year":"2007","unstructured":"Nesterov, Y.: Smoothing technique and its applications in semidefinite optimization. Math. Program. 110(2), 245\u2013259 (2007)","journal-title":"Math. Program."},{"issue":"1","key":"1264_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10107-012-0629-5","volume":"140","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective function. Math. Program. 140(1), 125\u2013161 (2013)","journal-title":"Math. Program."},{"key":"1264_CR35","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., Nemirovski, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial Mathematics, Philadelphia (1994)"},{"issue":"1","key":"1264_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.22.1.1","volume":"22","author":"Y Nesterov","year":"1997","unstructured":"Nesterov, Y., Todd, M.J.: Self-scaled barriers and interior-point methods for convex programming. Math. Oper. Res. 22(1), 1\u201342 (1997)","journal-title":"Math. Oper. Res."},{"key":"1264_CR37","series-title":"Springer Series in Operations Research and Financial Engineering","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, New York (2006)","edition":"2"},{"issue":"1","key":"1264_CR38","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01586928","volume":"51","author":"J-S Pang","year":"1991","unstructured":"Pang, J.-S.: A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems. Math. Program. 51(1), 101\u2013131 (1991)","journal-title":"Math. Program."},{"issue":"3","key":"1264_CR39","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"1264_CR40","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. Program. 58, 353\u2013367 (1993)","journal-title":"Math. Program."},{"issue":"2","key":"1264_CR41","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1287\/moor.19.2.352","volume":"19","author":"D Ralph","year":"1994","unstructured":"Ralph, D.: Global convergence of damped Newton\u2019s method for nonsmooth equations via the path search. Math. Oper. Res. 19(2), 352\u2013389 (1994)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"1264_CR42","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1287\/moor.5.1.43","volume":"5","author":"SM Robinson","year":"1980","unstructured":"Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5(1), 43\u201362 (1980)","journal-title":"Math. Oper. Res."},{"key":"1264_CR43","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/BF01027107","volume":"2","author":"SM Robinson","year":"1994","unstructured":"Robinson, S.M.: Newton\u2019s method for a class of nonsmooth functions. Set Valued Var. Anal. 2, 291\u2013305 (1994)","journal-title":"Set Valued Var. Anal."},{"key":"1264_CR44","series-title":"Volume 28 of Princeton Mathematics Series","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Volume 28 of Princeton Mathematics Series. Princeton University Press, Princeton (1970)"},{"key":"1264_CR45","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T., Wets, R\u00a0.J.-B.: Variational Analysis. Springer, Berlin (1997)"},{"issue":"1","key":"1264_CR46","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1137\/130910774","volume":"24","author":"R Shefi","year":"2014","unstructured":"Shefi, R., Teboulle, M.: Rate of convergence analysis of decomposition methods based on the proximal method of multipliers for convex minimization. SIAM J. Optim. 24(1), 269\u2013297 (2014)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1264_CR47","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1023\/A:1008777829180","volume":"7","author":"MV Solodov","year":"1999","unstructured":"Solodov, M.V., Svaiter, B.F.: A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator. Set Valued Var. Anal. 7(4), 323\u2013345 (1999)","journal-title":"Set Valued Var. Anal."},{"key":"1264_CR48","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11\u201312","author":"F Sturm","year":"1999","unstructured":"Sturm, F.: Using SeDuMi 1.02: A Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11\u201312, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"1264_CR49","unstructured":"Su, W., Boyd, S., Candes, E.: A differential equation for modeling Nesterov\u2019s accelerated gradient method: theory and insights. In: Advances in Neural Information Processing Systems (NIPS), pp. 2510\u20132518 (2014)"},{"key":"1264_CR50","doi-asserted-by":"crossref","unstructured":"Toh, K.-C., Todd, M.J., T\u00fct\u00fcnc\u00fc, R.H.: On the implementation and usage of SDPT3\u2014a Matlab software package for semidefinite-quadratic-linear programming. Technical Report 4, NUS Singapore (2010)","DOI":"10.1007\/978-1-4614-0769-0_25"},{"issue":"4","key":"1264_CR51","doi-asserted-by":"publisher","first-page":"1718","DOI":"10.1137\/130944539","volume":"24","author":"Q Tran-Dinh","year":"2014","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: An inexact proximal path-following algorithm for constrained convex minimization. SIAM J. Optim. 24(4), 1718\u20131745 (2014)","journal-title":"SIAM J. Optim."},{"key":"1264_CR52","doi-asserted-by":"crossref","unstructured":"Tran-Dinh, Q., Kyrillidis, A., Cevher, V.: A single phase proximal path-following framework. Math. Oper. Res. (2018) (accepted)","DOI":"10.1287\/moor.2017.0907"},{"issue":"1","key":"1264_CR53","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1137\/11085311X","volume":"23","author":"Q Tran-Dinh","year":"2013","unstructured":"Tran-Dinh, Q., 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."},{"key":"1264_CR54","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1137\/0329006","volume":"29","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: Applications of splitting algorithm to decomposition in convex programming and variational inequalities. SIAM J. Control Optim. 29, 119\u2013138 (1991)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1264_CR55","doi-asserted-by":"publisher","first-page":"951","DOI":"10.1137\/S1052623495279797","volume":"7","author":"P Tseng","year":"1997","unstructured":"Tseng, P.: Alternating projection-proximal methods for convex programming and variational inequalities. SIAM J. Optim. 7(4), 951\u2013965 (1997)","journal-title":"SIAM J. Optim."},{"key":"1264_CR56","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s12532-010-0017-1","volume":"2","author":"Z Wen","year":"2010","unstructured":"Wen, Z., Goldfarb, D., Yin, W.: Alternating direction augmented Lagrangian methods for semidefinite programming. Math. Program. Comput. 2, 203\u2013230 (2010)","journal-title":"Math. Program. Comput."},{"issue":"4","key":"1264_CR57","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s12532-012-0044-1","volume":"4","author":"Z Wen","year":"2012","unstructured":"Wen, Z., Yin, W., Zhang, Y.: Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm. Math. Program. Comput. 4(4), 333\u2013361 (2012)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1264_CR58","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10107-002-0305-2","volume":"94","author":"RS Womersley","year":"2002","unstructured":"Womersley, R.S., Sun, D., Qi, H.: A feasible semismooth asymptotically Newton method for mixed complementarity problems. Math. Program. 94(1), 167\u2013187 (2002)","journal-title":"Math. Program."},{"key":"1264_CR59","unstructured":"Wright, S.J.: Applying new optimization algorithms to model predictive control. In: Kantor J.C., Garcia C.E., Carnahan B. (eds) Fifth International Conference on Chemical Process Control\u2014CPCV, pp. 147\u2013155. American Institute of Chemical Engineers (1996)"},{"issue":"1","key":"1264_CR60","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-0427(02)00730-6","volume":"152","author":"N Xiu","year":"2003","unstructured":"Xiu, N., Zhang, J.: Some recent advances in projection-type methods for variational inequalities. J. Comput. Appl. Math. 152(1), 559\u2013585 (2003)","journal-title":"J. Comput. Appl. Math."},{"key":"1264_CR61","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-011-0449-z","volume":"135","author":"H Yamashita","year":"2012","unstructured":"Yamashita, H., Yabe, H., Harada, K.: A primal-dual interior point method for nonlinear semidefinite programming. Math. Program. 135, 89\u2013121 (2012)","journal-title":"Math. Program."},{"issue":"3","key":"1264_CR62","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s12532-015-0082-6","volume":"7","author":"L Yang","year":"2015","unstructured":"Yang, L., Sun, D., Toh, K.-C.: SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints. Math. Program. Comput. 7(3), 331\u2013366 (2015)","journal-title":"Math. Program. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1264-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1264-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1264-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T21:09:17Z","timestamp":1693602557000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1264-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,30]]},"references-count":62,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1264"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1264-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,30]]},"assertion":[{"value":"18 October 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 March 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}