{"response":{"award":[{"abstractText":"With the surge of artificial intelligence (AI) and data science, increasing data and parameters of machine learning models come with high-order structures, also known as tensors. Tensor decomposition (TD) is commonly used to compress the data and analyze the underlying information. This project aims to develop both theoretically justified and practically efficient TD algorithms, as well as algorithms for low-rank tensor approximations and tensor completions. Such tools have wide applications in data science, statistics, engineering, and industry, including multi-view learning, convolutional neural networks (CNNs), and large language models (LLMs). The project also includes training of undergraduate and graduate students studying in scientific computing and data science.\r\n\r\nThis project studies a range of challenging research tasks centered on the computation and analysis of tensor decompositions. A major goal is to overcome limitations of existing algebraic-based and optimization-based methods, which are either computationally expensive or theoretically insufficient.  The tensor decomposition algorithms utilized in this project are based on generating polynomials to reformulate and understand the non-symmetric TD. The developed TD algorithms will have the following advantages: computationally efficient in terms of speed and memory, easy to implement in linear algebra friendly software, have theoretical guarantees, can be used to detect certain tensor ranks, and support higher tensor ranks. For generic tensors satisfying certain rank bounds, the approach in this project is to construct the TD by solving linear equations. When the tensor rank is higher, the problem is reformulated as a nonlinear optimization with linear constraints and can be solved using modern optimization methods. The generating polynomial-based framework can also be utilized to reformulate and solve low-rank tensor approximation and tensor completion problems, which are widely used in data science applications.\r\n\r\nThis award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.","activeAwd":"true","agency":"NSF","awardAgencyCode":"4900","awardee":"LOUISIANA STATE UNIVERSITY","awardeeAddress":"202 HIMES HALL","awardeeCity":"BATON ROUGE","awardeeCountryCode":"US","awardeeDistrict":"05","awardeeDistrictCode":"LA05","awardeeName":"Louisiana State University","awardeePhone":"2255782760","awardeeStateCode":"LA","awardeeZipCode":"708030001","cfdaNumber":"47.049","coPDPI":["Hongchao Zhang hozhang@math.lsu.edu"],"date":"07/30/2025","dirAbbr":"MPS","divAbbr":"MMS","estimatedTotalAmt":"239806","expDate":"08/31/2028","fundAgencyCode":"4900","fundProgramName":"MSPA-INTERDISCIPLINARY, COMPUTATIONAL MATHEMATICS","fundsObligated":["FY 2025 = $239,806.00"],"fundsObligatedAmt":"239806","histAwd":"false","id":"2514001","initAmendmentDate":"07/30/2025","jrnl":[{"artTitl":"A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems","auth":"Chang, Xiaokai and Yang, Junfeng and Zhang, Hongchao","authIndCode":"N","dgtlObjId":"https://doi.org/10.1093/imanum/draf158","jrnlTitl":"IMA Journal of Numerical Analysis","jrnlYr":"2026","parPblcId":"10681630"},{"artTitl":"Adaptive proximal Barzilai-Borwein methods for nonlinear composite optimization","auth":"Pandey, Monika and Zhang, Hongchao and Zheng, Zequn","authIndCode":"N","dgtlObjId":"https://doi.org/10.1007/s11075-026-02367-y","jrnlTitl":"Numerical Algorithms","jrnlYr":"2026","parPblcId":"10710388"}],"latestAmendmentDate":"07/30/2025","managingPec":"127100","orgCodeDir":"03000000","orgCodeDiv":"03210000","orgLongName":"Directorate for Mathematical and Physical Sciences","orgLongName2":"Mathematical Science Section","orgUrl":"https://www.nsf.gov/mps","parentUeiNumber":"","pdPIName":"Zequn Zheng","perfAddress":"202 HIMES HALL","perfCity":"BATON ROUGE","perfCountryCode":"US","perfDistrict":"05","perfDistrictCode":"LA05","perfLocation":"Louisiana State University","perfStateCode":"LA","perfZipCode":"708030001","pi":["Zequn Zheng zzheng@lsu.edu"],"piEmail":"zzheng@lsu.edu","piFirstName":"Zequn","piId":"270118202","piLastName":"Zheng","poEmail":"yepshtey@nsf.gov","poName":"Yekaterina Epshteyn","poPhone":"7032920000","primaryProgram":["01002526DB NSF RESEARCH & RELATED ACTIVIT"],"progEleCode":"745400, 127100","program":"EXP PROG TO STIM COMP RES, COMPUTATIONAL SCIENCE & ENGING","progRefCode":"9150, 9263","publicAccessMandate":"1","publicationResearch":["IMA Journal of Numerical Analysis~2026~Chang, Xiaokai and Yang, Junfeng and Zhang, Hongchao~https://doi.org/10.1093/imanum/draf158~A convex combination based primal-dual algorithm with linesearch for general convex-concave saddle point problems~N~10681630~10681630~OSTI~2026-05-06 13:04:52.51","Numerical Algorithms~2026~Pandey, Monika and Zhang, Hongchao and Zheng, Zequn~https://doi.org/10.1007/s11075-026-02367-y~Adaptive proximal Barzilai-Borwein methods for nonlinear composite optimization~N~10710388~10710388~OSTI~2026-08-30 20:41:32.563"],"startDate":"09/01/2025","title":"Computation of Non-symmetric Tensor Decomposition: Theory, Algorithms and Applications","transType":"Standard Grant","ueiNumber":"ECQEYCHRNKJ4"}],"metadata":{"offset":0,"rpp":25,"totalCount":1}}}