{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:23:00Z","timestamp":1777454580393,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,8,4]],"date-time":"2014-08-04T00:00:00Z","timestamp":1407110400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s11590-014-0775-1","type":"journal-article","created":{"date-parts":[[2014,8,3]],"date-time":"2014-08-03T03:21:08Z","timestamp":1407036068000},"page":"731-741","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Projection onto simplicial cones by a semi-smooth Newton method"],"prefix":"10.1007","volume":"9","author":[{"given":"O. P.","family":"Ferreira","sequence":"first","affiliation":[]},{"given":"S. Z.","family":"N\u00e9meth","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,4]]},"reference":[{"issue":"2","key":"775_CR1","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1016\/j.jmaa.2011.08.048","volume":"386","author":"M Abbas","year":"2012","unstructured":"Abbas, M., N\u00e9meth, S.Z.: Solving nonlinear complementarity problems by isotonicity of the metric projection. J. Math. Anal. Appl. 386(2), 882\u2013893 (2012)","journal-title":"J. Math. Anal. Appl."},{"issue":"2, Ser. B","key":"775_CR2","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF01581078","volume":"57","author":"KS Al-Sultan","year":"1992","unstructured":"Al-Sultan, K.S., Murty, K.G.: Exterior point algorithms for nearest points and convex quadratic programs. Math. Program. 57(2, Ser. B), 145\u2013161 (1992)","journal-title":"Math. Program."},{"issue":"3","key":"775_CR3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"HH Bauschke","year":"1996","unstructured":"Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"775_CR4","series-title":"Theory and algorithms","doi-asserted-by":"crossref","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming","author":"MS Bazaraa","year":"2006","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming. Theory and algorithms, 3rd edn. Wiley, Hoboken (2006)","edition":"3"},{"issue":"433","key":"775_CR5","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1080\/01621459.1996.10476691","volume":"91","author":"R Berk","year":"1996","unstructured":"Berk, R., Marcus, R.: Dual cones, dual norms, and simultaneous inference for partially ordered means. J. Am. Statist. Assoc. 91(433), 318\u2013328 (1996)","journal-title":"J. Am. Statist. Assoc."},{"issue":"1","key":"775_CR6","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/050639399","volume":"30","author":"Y Censor","year":"2007\/08","unstructured":"Censor, Y., Elfving, T., Herman, G.T., Nikazad, T.: On diagonally relaxed orthogonal projection methods. SIAM J. Sci. Comput. 30(1), 473\u2013504 (2007\/08)","journal-title":"SIAM J. Sci. Comput."},{"issue":"6","key":"775_CR7","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1016\/S0167-8191(00)00100-9","volume":"27","author":"Y Censor","year":"2001","unstructured":"Censor, Y., Gordon, D., Gordon, R.: Component averaging: an efficient iterative parallel algorithm for large and sparse unstructured problems. Parallel Comput. 27(6), 777\u2013808 (2001)","journal-title":"Parallel Comput."},{"issue":"3","key":"775_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0166-218X(89)90002-4","volume":"25","author":"SY Chang","year":"1989","unstructured":"Chang, S.Y., Murty, K.G.: The steepest descent gravitational method for linear programming. Discrete Appl. Math. 25(3), 211\u2013239 (1989)","journal-title":"Discrete Appl. Math."},{"key":"775_CR9","unstructured":"Clarke, F.H.: Optimization and Nonsmooth Analysis. Classics in applied mathematics, vol. 2. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA (1990)"},{"key":"775_CR10","doi-asserted-by":"crossref","unstructured":"Dennis, J.E. Jr., Schnabel, R.B.: Numerical methods for unconstrained optimization and nonlinear equations, volume 16 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, (1996) (Corrected reprint of the 1983 original)","DOI":"10.1137\/1.9781611971200"},{"issue":"5\u20136","key":"775_CR11","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/01630569408816580","volume":"15","author":"F Deutsch","year":"1994","unstructured":"Deutsch, F., Hundal, H.: The rate of convergence of Dykstra\u2019s cyclic projections algorithm: the polyhedral case. Numer. Funct. Anal. Optim. 15(5\u20136), 537\u2013565 (1994)","journal-title":"Numer. Funct. Anal. Optim."},{"issue":"384","key":"775_CR12","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/01621459.1983.10477029","volume":"78","author":"RL Dykstra","year":"1983","unstructured":"Dykstra, R.L.: An algorithm for restricted least squares regression. J. Am. Statist. Assoc. 78(384), 837\u2013842 (1983)","journal-title":"J. Am. Statist. Assoc."},{"key":"775_CR13","unstructured":"Ek\u00e1rt, A., N\u00e9meth, A.B., N\u00e9meth, S.Z.: Rapid heuristic projection on simplicial cones (2010) arXiv:1001.1928"},{"key":"775_CR14","unstructured":"Foley, J.D., van Dam, A., Feiner, S.K., Hughes, J.F.: Computer Graphics: Principles and Practice. Addison-Wesley systems programming series (1990)"},{"issue":"8","key":"775_CR15","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1002\/bimj.4710390808","volume":"39","author":"H Frick","year":"1997","unstructured":"Frick, H.: Computing projections into cones generated by a matrix. Biometrical J. 39(8), 975\u2013987 (1997)","journal-title":"Biometrical J."},{"key":"775_CR16","doi-asserted-by":"crossref","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex analysis and minimization algorithms: Fundamentals. I. Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], volume 305, Springer, Berlin (1993)","DOI":"10.1007\/978-3-662-02796-7"},{"issue":"2","key":"775_CR17","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1111\/1467-842X.00018","volume":"40","author":"X Hu","year":"1998","unstructured":"Hu, X.: An exact algorithm for projection onto a polyhedral cone. Aust. N. Z. J. Stat. 40(2), 165\u2013170 (1998)","journal-title":"Aust. N. Z. J. Stat."},{"issue":"4","key":"775_CR18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01535523","volume":"6","author":"T Huynh","year":"1992","unstructured":"Huynh, T., Lassez, C., Lassez, J.-L.: Practical issues on the projection of polyhedral sets. Ann. Math. Artif. Intell. 6(4), 295\u2013315 (1992). Artificial intelligence and mathematics, II","journal-title":"Ann. Math. Artif. Intell."},{"issue":"6","key":"775_CR19","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1007\/BF01195027","volume":"46","author":"G Isac","year":"1986","unstructured":"Isac, G., N\u00e9meth, A.B.: Monotonicity of metric projections onto positive cones of ordered Euclidean spaces. Arch. Math. (Basel) 46(6), 568\u2013576 (1986)","journal-title":"Arch. Math. (Basel)"},{"issue":"1","key":"775_CR20","first-page":"35","volume":"16","author":"G Isac","year":"1992","unstructured":"Isac, G., N\u00e9meth, A.B.: Isotone projection cones in Euclidean spaces. Ann. Sci. Math. Qu\u00e9bec 16(1), 35\u201352 (1992)","journal-title":"Ann. Sci. Math. Qu\u00e9bec"},{"issue":"3","key":"775_CR21","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/s10589-009-9303-0","volume":"49","author":"Z Liu","year":"2011","unstructured":"Liu, Z., Fathi, Y.: An active index algorithm for the nearest point problem in a polyhedral cone. Comput. Optim. Appl. 49(3), 435\u2013456 (2011)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"775_CR22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-011-9448-5","volume":"53","author":"Z Liu","year":"2012","unstructured":"Liu, Z., Fathi, Y.: The nearest point problem in a polyhedral set and its extensions. Comput. Optim. Appl. 53(1), 115\u2013130 (2012)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"775_CR23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s11590-008-0094-5","volume":"3","author":"OL Mangasarian","year":"2009","unstructured":"Mangasarian, O.L.: A generalized Newton method for absolute value equations. Optim. Lett. 3(1), 101\u2013108 (2009)","journal-title":"Optim. Lett."},{"issue":"3","key":"775_CR24","first-page":"945","volume":"17","author":"T Ming","year":"2007","unstructured":"Ming, T., Guo-Liang, T., Hong-Bin, F., Kai Wang, Ng: A fast EM algorithm for quadratic optimization subject to convex constraints. Statist. Sinica 17(3), 945\u2013964 (2007)","journal-title":"Statist. Sinica"},{"key":"775_CR25","first-page":"238","volume":"255","author":"JJ Moreau","year":"1962","unstructured":"Moreau, J.J.: D\u00e9composition orthogonale d\u2019un espace hilbertien selon deux c\u00f4nes mutuellement polaires. C. R. Acad. Sci. 255, 238\u2013240 (1962)","journal-title":"C. R. Acad. Sci."},{"issue":"1","key":"775_CR26","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1016\/j.amc.2004.06.136","volume":"167","author":"PM Morillas","year":"2005","unstructured":"Morillas, P.M.: Dykstra\u2019s algorithm with strategies for projecting onto certain polyhedral cones. Appl. Math. Comput. 167(1), 635\u2013649 (2005)","journal-title":"Appl. Math. Comput."},{"key":"775_CR27","series-title":"Linear complementarity, linear and nonlinear programming","volume-title":"Sigma Series in Applied Mathematics","author":"KG Murty","year":"1988","unstructured":"Murty, K.G.: Sigma Series in Applied Mathematics. Linear complementarity, linear and nonlinear programming. Heldermann, Berlin (1988)"},{"issue":"2","key":"775_CR28","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF01583789","volume":"23","author":"KG Murty","year":"1982","unstructured":"Murty, K.G., Fathi, Y.: A critical index algorithm for nearest point problems on simplicial cones. Math. Program. 23(2), 206\u2013215 (1982)","journal-title":"Math. Program."},{"issue":"1","key":"775_CR29","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.laa.2010.02.008","volume":"433","author":"AB N\u00e9meth","year":"2010","unstructured":"N\u00e9meth, A.B., N\u00e9meth, S.Z.: How to project onto an isotone projection cone. Linear Algebra Appl. 433(1), 41\u201351 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"775_CR30","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/s10474-009-9145-3","volume":"127","author":"SZ N\u00e9meth","year":"2010","unstructured":"N\u00e9meth, S.Z.: Characterization of latticial cones in Hilbert spaces by isotonicity and generalized infimum. Acta Math. Hungar. 127(4), 376\u2013390 (2010)","journal-title":"Acta Math. Hungar."},{"issue":"2","key":"775_CR31","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1016\/j.na.2010.03.044","volume":"73","author":"SZ N\u00e9meth","year":"2010","unstructured":"N\u00e9meth, S.Z.: Isotone retraction cones in Hilbert spaces. Nonlinear Anal. 73(2), 495\u2013499 (2010)","journal-title":"Nonlinear Anal."},{"issue":"1\u20132, Ser. B","key":"775_CR32","first-page":"273","volume":"111","author":"HD Scolnik","year":"2008","unstructured":"Scolnik, H.D., Echebest, N., Guardarucci, M.T., Vacchino, M.C.: Incomplete oblique projections for solving large inconsistent linear systems. Math. Program. 111(1\u20132, Ser. B), 273\u2013300 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"775_CR33","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02677683","volume":"16","author":"X Shusheng","year":"2000","unstructured":"Shusheng, X.: Estimation of the convergence rate of Dykstra\u2019s cyclic projections algorithm in polyhedral case. Acta Math. Appl. Sinica (English Ser.) 16(2), 217\u2013220 (2000)","journal-title":"Acta Math. Appl. Sinica (English Ser.)"},{"issue":"4","key":"775_CR34","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1137\/1019104","volume":"19","author":"GW Stewart","year":"1977","unstructured":"Stewart, G.W.: On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM Rev. 19(4), 634\u2013662 (1977)","journal-title":"SIAM Rev."},{"key":"775_CR35","unstructured":"Ujv\u00e1ri, M.: On the projection onto a finitely generated cone, 2007, Preprint WP 2007\u20135. MTA SZTAKI, Laboratory of Operations Research and Decision Systems, Budapest (2007)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0775-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0775-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0775-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T14:14:04Z","timestamp":1565705644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0775-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,4]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["775"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0775-1","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,4]]}}}