{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:18:21Z","timestamp":1742987901501,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031814037"},{"type":"electronic","value":"9783031814044"}],"license":[{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:00:00Z","timestamp":1735603200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-81404-4_12","type":"book-chapter","created":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T00:38:21Z","timestamp":1735605501000},"page":"146-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancing QR Decomposition: A GPU-Based Approach to\u00a0Parallelizing the\u00a0Householder Algorithm with\u00a0CUDA Streams"],"prefix":"10.1007","author":[{"given":"Uppu","family":"Eshwar","sequence":"first","affiliation":[]},{"given":"Soumyajit","family":"Chatterjee","sequence":"additional","affiliation":[]},{"given":"Sathya","family":"Peri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,31]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/BF02192216","volume":"82","author":"JT Betts","year":"1994","unstructured":"Betts, J.T., Frank, P.D.: A sparse nonlinear optimization algorithm. J. Optim. Theory Appl. 82, 519\u2013541 (1994)","journal-title":"J. Optim. Theory Appl."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numerica 4, 1\u201351 (1995)","journal-title":"Acta Numerica"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1017\/S0962492900002518","volume":"4","author":"PT Boggs","year":"1995","unstructured":"Boggs, P.T., Tolle, J.W.: Sequential quadratic programming. Acta Numerica 4, 24\u201325 (1995)","journal-title":"Acta Numerica"},{"key":"12_CR4","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)"},{"issue":"1\u20133","key":"12_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BF01582063","volume":"63","author":"RH Byrd","year":"1994","unstructured":"Byrd, R.H., Nocedal, J., Schnabel, R.B.: Representations of quasi-newton matrices and their use in limited memory methods. Math. Program. 63(1\u20133), 129\u2013156 (1994)","journal-title":"Math. Program."},{"key":"12_CR6","unstructured":"NVIDIA Corporation. The API reference guide for cublas, the cuda basic linear algebra subroutine library (2024). https:\/\/docs.nvidia.com\/cuda\/cublas\/#introduction"},{"key":"12_CR7","unstructured":"NVIDIA Corporation. The API reference guide for cusolver, a GPU accelerated library for decompositions and linear system solutions for both dense and sparse matrices (2024). https:\/\/docs.nvidia.com\/cuda\/cusolver\/index.html#:~:text=The%20intent%20of,shared%20sparsity%20pattern"},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"PE Gill","year":"2005","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"key":"12_CR9","unstructured":"Golub, G.H., Van\u00a0Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences. Johns Hopkins University Press (2013)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.future.2019.02.028","volume":"97","author":"AA Heidari","year":"2019","unstructured":"Heidari, A.A., Mirjalili, S., Faris, H., Aljarah, I., Mafarja, M., Chen, H.: Harris hawks optimization: algorithm and applications. Futur. Gener. Comput. Syst. 97, 849\u2013872 (2019)","journal-title":"Futur. Gener. Comput. Syst."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Herskovits, J.N., Carvalho, L.A.V.: A successive quadratic programming based feasible directions algorithm. In: Bensoussan, A., Lions, J.L. (eds.) Analysis and Optimization of Systems, pp. 93\u2013101. Springer, Heidelberg (1986)","DOI":"10.1007\/BFb0007550"},{"key":"12_CR12","unstructured":"Johnson, S.G.: The NLopt nonlinear-optimization package (2007). https:\/\/github.com\/stevengj\/nlopt"},{"key":"12_CR13","unstructured":"Wright, S.J., Nocedal, J.: Numerical Optimization. Springer, New York (2006)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/192115.192124","volume":"20","author":"D Kraft","year":"1994","unstructured":"Kraft, D.: Algorithm 733: TOMP-fortran modules for optimal control calculations. ACM Trans. Math. Softw. 20, 262\u2013281 (1994)","journal-title":"ACM Trans. Math. Softw."},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1137\/S1052623498344562","volume":"11","author":"CT Lawrence","year":"2001","unstructured":"Lawrence, C.T., Tits, A.L.: A computationally efficient feasible sequential quadratic programming algorithm. SIAM J. Optim. 11(4), 1092\u20131118 (2001)","journal-title":"SIAM J. Optim."},{"key":"12_CR16","unstructured":"Joaquim, R.R.A.: Martins and Andrew Ning. Engineering Design Optimization. Cambridge University Press, Cambridge (2021)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Nemhauser, G., Wolsey, L.: Linear Programming, chap. I.2, pp. 27\u201349. Wiley (1988)","DOI":"10.1002\/9781118627372.ch2"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Nickolls, J., Buck, I., Garland, M., Skadron, K.: Scalable parallel programming with Cuda. In: ACM SIGGRAPH 2008 Classes, SIGGRAPH 2008. Association for Computing Machinery, New York (2008)","DOI":"10.1145\/1401132.1401152"},{"issue":"151","key":"12_CR19","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1090\/S0025-5718-1980-0572855-7","volume":"35","author":"J Nocedal","year":"1980","unstructured":"Nocedal, J.: Updating quasi-newton matrices with limited storage. Math. Comput. 35(151), 773\u2013782 (1980)","journal-title":"Math. Comput."},{"key":"12_CR20","unstructured":"Joe\u00a0Eaton NVIDIA\u00a0Corporation. Parallel direct solvers with cusolver: Batched qr (2015). https:\/\/developer.nvidia.com\/blog\/parallel-direct-solvers-with-cusolver-batched-qr\/#:~:text=cuSOLVER%20provides%20batch,deliver%20decent%20performance"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Potra, F.A., Wright, S.J.: Interior-point methods. J. Comput. Appl. Mathe. 124(1), 281\u2013302 (2000). Numerical Analysis 2000. Vol. IV: Optimization and Nonlinear Equations","DOI":"10.1016\/S0377-0427(00)00433-7"},{"key":"12_CR22","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841059","volume-title":"Nonlinear Optimization","author":"A Ruszczy\u0144ski","year":"2006","unstructured":"Ruszczy\u0144ski, A.: Nonlinear Optimization. Princeton University Press, Princeton (2006)"},{"issue":"16","key":"12_CR23","doi-asserted-by":"publisher","first-page":"12363","DOI":"10.1007\/s00521-020-04832-8","volume":"32","author":"A Slowik","year":"2020","unstructured":"Slowik, A., Kwasnicka, H.: Evolutionary algorithms and their applications to engineering problems. Neural Comput. Appl. 32(16), 12363\u201312379 (2020)","journal-title":"Neural Comput. Appl."},{"key":"12_CR24","unstructured":"Sun, W., Yuan, Y.-X.: Optimization Theory and Methods: Nonlinear Programming, vol. 1. Springer, Heidelberg (2006)"},{"key":"12_CR25","unstructured":"Wikipedia contributors. Thread block (Cuda programming) \u2014 Wikipedia, the free encyclopedia (2024). Accessed 24 Aug 2024"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Intelligent Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81404-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T01:03:36Z","timestamp":1735607016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81404-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,31]]},"ISBN":["9783031814037","9783031814044"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81404-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,31]]},"assertion":[{"value":"31 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Intelligent Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icdcit.ac.in","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}