{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T06:24:36Z","timestamp":1769754276787,"version":"3.49.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T00:00:00Z","timestamp":1566777600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10589-019-00122-9","type":"journal-article","created":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T09:02:38Z","timestamp":1566810158000},"page":"627-643","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Solution refinement at regular points of conic problems"],"prefix":"10.1007","volume":"74","author":[{"given":"Enzo","family":"Busseti","sequence":"first","affiliation":[]},{"given":"Walaa M.","family":"Moursi","sequence":"additional","affiliation":[]},{"given":"Stephen","family":"Boyd","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,26]]},"reference":[{"key":"122_CR1","unstructured":"Ali, A.,\u00a0Wong, E.,\u00a0Kolter, J.: A semismooth newton method for fast, generic convex programming. In: Proceedings of the 34th International Conference on Machine Learning, pp. 272\u2013279 (2018)"},{"issue":"1","key":"122_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2400000023","volume":"3","author":"S Boyd","year":"2017","unstructured":"Boyd, S., Busseti, E., Diamond, S., Kahn, R., Koh, K., Nystrup, P., Speth, J.: Multi-period trading via convex optimization. Found. Trends Optim. 3(1), 1\u201376 (2017)","journal-title":"Found. Trends Optim."},{"key":"122_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"H Bauschke","year":"2017","unstructured":"Bauschke, H., Combettes, P.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"issue":"3","key":"122_CR4","doi-asserted-by":"publisher","first-page":"118","DOI":"10.3905\/joi.2016.25.3.118","volume":"25","author":"E Busseti","year":"2016","unstructured":"Busseti, E., Ryu, E., Boyd, S.: Risk-constrained Kelly gambling. J. Invest. 25(3), 118\u2013134 (2016)","journal-title":"J. Invest."},{"issue":"3","key":"122_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF01109805","volume":"100","author":"F Browder","year":"1967","unstructured":"Browder, F.: Convergence theorems for sequences of nonlinear operators in Banach spaces. Math. Z. 100(3), 201\u2013225 (1967)","journal-title":"Math. Z."},{"key":"122_CR6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization. SIAM, Philadelphia (2001)"},{"key":"122_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"122_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/9781108583664","volume-title":"Introduction to Applied Linear Algebra - Vectors, Matrices, and Least Squares","author":"S Boyd","year":"2018","unstructured":"Boyd, S., Vandenberghe, L.: Introduction to Applied Linear Algebra - Vectors, Matrices, and Least Squares. Cambridge University Press, Cambridge (2018)"},{"issue":"4","key":"122_CR9","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1137\/S1052623400380584","volume":"13","author":"X Chen","year":"2003","unstructured":"Chen, X., Qi, H.D., Tseng, P.: Analysis of nonsmooth symmetric-matrix-valued functions with applications to semidefinite complementarity problems. SIAM J. Optim. 13(4), 960\u2013985 (2003)","journal-title":"SIAM J. Optim."},{"issue":"83","key":"122_CR10","first-page":"1","volume":"16","author":"S Diamond","year":"2016","unstructured":"Diamond, S., Boyd, S.: CVXPY: a Python-embedded modeling language for convex optimization. J. Mach. Learn. Res. 16(83), 1\u20135 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"122_CR11","doi-asserted-by":"crossref","unstructured":"Domahidi, A.,\u00a0Chu, E.,\u00a0Boyd, S.: ECOS: an SOCP solver for embedded systems. In: 2013 European Control Conference, pp. 3071\u20133076. IEEE (2013)","DOI":"10.23919\/ECC.2013.6669541"},{"key":"122_CR12","volume-title":"Measure Theory and Fine Properties of Functions","author":"L Evans","year":"1992","unstructured":"Evans, L., Gariepy, R.: Measure Theory and Fine Properties of Functions. CRC Press, Boca Raton (1992)"},{"issue":"4","key":"122_CR13","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18(4), 1035\u20131064 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"122_CR14","doi-asserted-by":"crossref","unstructured":"Fu, A., Narasimhan, B., Boyd, S.: CVXR: an R package for disciplined convex optimization. J. Stat. Softw. (2019) (to appear)","DOI":"10.18637\/jss.v094.i14"},{"key":"122_CR15","doi-asserted-by":"crossref","unstructured":"Grant, M.,\u00a0Boyd, S.: Graph implementations for nonsmooth convex programs. In: Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer (2008)","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"122_CR16","unstructured":"Grant, M.,\u00a0Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx (2014)"},{"issue":"2","key":"122_CR17","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/146847.146929","volume":"18","author":"J Gardiner","year":"1992","unstructured":"Gardiner, J., Laub, A., Amato, J., Moler, C.: Solution of the Sylvester matrix equation $$AXB^{ T}+CXD^{T}=E$$. ACM Trans. Math. Softw. 18(2), 223\u2013231 (1992)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3","key":"122_CR18","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1287\/moor.24.3.529","volume":"24","author":"H Jiang","year":"1999","unstructured":"Jiang, H.: Global convergence analysis of the generalized Newton and Gauss\u2013Newton methods of the Fischer\u2013Burmeister equation for the complementarity problem. Math. Oper. Res. 24(3), 529\u2013543 (1999)","journal-title":"Math. Oper. Res."},{"key":"122_CR19","unstructured":"Jones, E.,\u00a0Oliphant, T.,\u00a0Peterson, P., Others: SciPy: Open source scientific tools for Python. http:\/\/www.scipy.org\/ (2001). Accessed 4 Mar 2019"},{"issue":"1","key":"122_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1137\/060657662","volume":"20","author":"C Kanzow","year":"2009","unstructured":"Kanzow, C., Ferenczi, I., Fukushima, M.: On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity. SIAM J. Optim. 20(1), 297\u2013320 (2009)","journal-title":"SIAM J. Optim."},{"key":"122_CR21","unstructured":"L\u00f6fberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the IEEE International Symposium on Computer Aided Control Systems Design, pp. 284\u2013289 (2004)"},{"issue":"2","key":"122_CR22","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/TAC.1967.1098538","volume":"12","author":"L Lasdon","year":"1967","unstructured":"Lasdon, L., Mitter, S., Waren, A.: The conjugate gradient method for optimal control problems. IEEE Trans. Autom. Control 12(2), 132\u2013138 (1967)","journal-title":"IEEE Trans. Autom. Control"},{"key":"122_CR23","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux c\u00f4nes mutuellement polaires. Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France 93, 273\u2013299 (1965)","journal-title":"Bulletin de la Soci\u00e9t\u00e9 Math\u00e9matique de France"},{"key":"122_CR24","unstructured":"MOSEK\u00a0ApS. The MOSEK optimization toolbox for MATLAB manual, version 8.0 (revision 57) (2017)"},{"issue":"3","key":"122_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s11228-005-0005-1","volume":"14","author":"J Malick","year":"2006","unstructured":"Malick, J., Sendov, H.: Clarke generalized Jacobian of the projection onto the cone of positive semidefinite matrices. Set-Valued Anal. 14(3), 273\u2013293 (2006)","journal-title":"Set-Valued Anal."},{"issue":"1\u20132","key":"122_CR26","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0377-0427(00)00426-X","volume":"124","author":"S Nash","year":"2000","unstructured":"Nash, S.: A survey of truncated-Newton methods. J. Comput. Appl. Math. 124(1\u20132), 45\u201359 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"122_CR27","volume-title":"Numerical Optimization. Springer Series in Operations Research and Financial Engineering","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization. Springer Series in Operations Research and Financial Engineering, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"122_CR28","unstructured":"Numba\u00a0Development Team. Numba. http:\/\/numba.pydata.org (2015). Accessed 4 Mar 2019"},{"issue":"3","key":"122_CR29","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1007\/s10957-016-0892-3","volume":"169","author":"B O\u2019Donoghue","year":"2016","unstructured":"O\u2019Donoghue, B., Chu, E., Parikh, N., Boyd, S.: Conic optimization via operator splitting and homogeneous self-dual embedding. J. Optim. Theory Appl. 169(3), 1042\u20131068 (2016)","journal-title":"J. Optim. Theory Appl."},{"key":"122_CR30","volume-title":"A Guide to NumPy","author":"T Oliphant","year":"2006","unstructured":"Oliphant, T.: A Guide to NumPy, vol. 1. Trelgol Publishing, Spanish Fork (2006)"},{"issue":"3","key":"122_CR31","first-page":"123","volume":"1","author":"N Parikh","year":"2014","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2014)","journal-title":"Found. Trends Optim."},{"issue":"3","key":"122_CR32","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1137\/15M1049415","volume":"27","author":"F Permenter","year":"2017","unstructured":"Permenter, F., Friberg, H.A., Andersen, E.D.: Solving conic optimization problems via self-dual embedding and facial reduction: a unified approach. SIAM J. Optim, 27(3), 1257\u20131282 (2017)","journal-title":"SIAM J. Optim,"},{"issue":"1","key":"122_CR33","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C Paige","year":"1982","unstructured":"Paige, C., Saunders, M.: LSQR: an algorithm for sparse linear equations and sparse least squares. ACM Trans. Math. Softw. 8(1), 43\u201371 (1982)","journal-title":"ACM Trans. Math. Softw."},{"issue":"3, Ser. A","key":"122_CR34","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(3, Ser. A), 353\u2013367 (1993)","journal-title":"Math. Program."},{"key":"122_CR35","doi-asserted-by":"crossref","unstructured":"Qi, L., Sun.: A survey of some nonsmooth equations and smoothing Newton methods. In: Progress in Optimization, volume\u00a030 of Applied Optimization, pp. 121\u2013146. Kluwer (1999)","DOI":"10.1007\/978-1-4613-3285-5_7"},{"key":"122_CR36","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R Rockafellar","year":"1970","unstructured":"Rockafellar, R.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"122_CR37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R Rockafellar","year":"1998","unstructured":"Rockafellar, R., Wets, R.: Variational Analysis. Springer, Berlin (1998)"},{"key":"122_CR38","doi-asserted-by":"crossref","unstructured":"Stellato, B., Banjac, G., Goulart, P., Bemporad, A., Boyd, S.: OSQP: an operator splitting solver for quadratic programs. ArXiv e-prints (2017)","DOI":"10.1109\/CONTROL.2018.8516834"},{"key":"122_CR39","doi-asserted-by":"crossref","unstructured":"SCS. Splitting conic solve, version 1.1.0. https:\/\/github.com\/cvxgrp\/scs (2015)","DOI":"10.1002\/9783527678679.dg11558"},{"issue":"2","key":"122_CR40","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/moor.1070.0300","volume":"33","author":"D Sun","year":"2008","unstructured":"Sun, D., Sun, J.: L\u00f6wner\u2019s operator and spectral functions in Euclidean Jordan algebras. Math. Oper. Res. 33(2), 421\u2013445 (2008)","journal-title":"Math. Oper. Res."},{"issue":"1\u20134","key":"122_CR41","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J Sturm","year":"1999","unstructured":"Sturm, J.: Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"122_CR42","first-page":"527","volume":"99","author":"J Sylvester","year":"1884","unstructured":"Sylvester, J.: Sur l\u2019\u00e9quation lin\u00e9aire trin\u00f4me en matrices d\u2019un ordre quelconque. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences 99, 527\u2013529 (1884)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"122_CR43","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139924672","volume-title":"Convex Optim. Power Syst.","author":"J Taylor","year":"2015","unstructured":"Taylor, J.: Convex Optim. Power Syst. Cambridge University Press, Cambridge (2015)"},{"key":"122_CR44","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2906393","author":"A Themelis","year":"2019","unstructured":"Themelis, A., Patrinos, P.: SuperMann: a superlinearly convergent algorithm for finding fixed points of nonexpansive operators. IEEE Trans. Autom. Control (2019). https:\/\/doi.org\/10.1109\/TAC.2019.2906393","journal-title":"IEEE Trans. Autom. Control"},{"key":"122_CR45","doi-asserted-by":"crossref","unstructured":"Udell, M., Mohan, K., Zeng, D., Hong, J., Diamond, S., Boyd, S.: Convex optimization in Julia. In: SC14 Workshop on High Performance Technical Computing in Dynamic Languages (2014)","DOI":"10.1109\/HPTCDL.2014.5"},{"issue":"4","key":"122_CR46","first-page":"387","volume":"26","author":"S Wright","year":"1985","unstructured":"Wright, S., Holt, J.: An inexact Levenberg\u2013Marquardt method for large sparse nonlinear least squares. ANZIAM J. 26(4), 387\u2013403 (1985)","journal-title":"ANZIAM J."},{"issue":"1","key":"122_CR47","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y Ye","year":"1994","unstructured":"Ye, Y., Todd, M., Mizuno, S.: An $${O}(\\sqrt{n}{L})$$-iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19(1), 53\u201367 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00122-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00122-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00122-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,26]],"date-time":"2022-09-26T11:27:18Z","timestamp":1664191638000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00122-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,26]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["122"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00122-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,26]]},"assertion":[{"value":"5 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}