{"id":"https://openalex.org/W2026890617","doi":"https://doi.org/10.1137/s1052623494267723","title":"Tensor Methods for Large, Sparse Unconstrained Optimization","display_name":"Tensor Methods for Large, Sparse Unconstrained Optimization","publication_year":1997,"publication_date":"1997-08-01","ids":{"openalex":"https://openalex.org/W2026890617","doi":"https://doi.org/10.1137/s1052623494267723","mag":"2026890617"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623494267723","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494267723","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5012244948","display_name":"Ali Bouaricha","orcid":null},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ali Bouaricha","raw_affiliation_strings":["(Centre EuropCen de 'Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, 60439. Recherche et de Formation Avancle en C:alcul Scientifique)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(Centre EuropCen de 'Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, 60439. Recherche et de Formation Avancle en C:alcul Scientifique)","institution_ids":["https://openalex.org/I1282105669"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5012244948"],"corresponding_institution_ids":["https://openalex.org/I1282105669"],"apc_list":null,"apc_paid":null,"fwci":0.4683,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.6315331,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"7","issue":"3","first_page":"732","last_page":"756"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12303","display_name":"Tensor decomposition and applications","score":0.9857000112533569,"subfield":{"id":"https://openalex.org/subfields/2605","display_name":"Computational Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7908099889755249},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.7843692302703857},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7613239884376526},{"id":"https://openalex.org/keywords/tensor","display_name":"Tensor (intrinsic definition)","score":0.6584076285362244},{"id":"https://openalex.org/keywords/invertible-matrix","display_name":"Invertible matrix","score":0.5406981706619263},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5276692509651184},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49625927209854126},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.44254568219184875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36448216438293457},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21421748399734497},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.10546675324440002}],"concepts":[{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7908099889755249},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.7843692302703857},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7613239884376526},{"id":"https://openalex.org/C155281189","wikidata":"https://www.wikidata.org/wiki/Q3518150","display_name":"Tensor (intrinsic definition)","level":2,"score":0.6584076285362244},{"id":"https://openalex.org/C96442724","wikidata":"https://www.wikidata.org/wiki/Q242188","display_name":"Invertible matrix","level":2,"score":0.5406981706619263},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5276692509651184},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49625927209854126},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.44254568219184875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36448216438293457},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21421748399734497},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.10546675324440002},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s1052623494267723","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623494267723","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.31.4135","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.4135","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://softlib.rice.edu/pub/CRPC-TRs/reports/CRPC-TR94585.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.38.1572","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.1572","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://info.mcs.anl.gov/pub/tech_reports/reports/P452.ps.Z","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.55.8217","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.8217","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cerfacs.fr/algor/reports/TR_PA_94_02.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320338284","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1968553199","https://openalex.org/W1983230696","https://openalex.org/W2012604196","https://openalex.org/W2043938310","https://openalex.org/W2057197834","https://openalex.org/W2068484625","https://openalex.org/W2068980859","https://openalex.org/W2117592165","https://openalex.org/W2119842211"],"related_works":["https://openalex.org/W2611031068","https://openalex.org/W1704347466","https://openalex.org/W1996936972","https://openalex.org/W4283017538","https://openalex.org/W1545275724","https://openalex.org/W2802707792","https://openalex.org/W2569979269","https://openalex.org/W2075777916","https://openalex.org/W3021699548","https://openalex.org/W4291718021"],"abstract_inverted_index":{"Tensor":[0],"methods":[1,22,39,61,96,106],"for":[2,23,63,74],"unconstrained":[3,43],"optimization":[4,44,67],"were":[5],"first":[6],"introduced":[7],"by":[8],"Schnabel":[9],"and":[10,86,101],"Chow":[11],"[SIAM":[12],"J.":[13],"Optim.,":[14],"1":[15],"(1991),":[16],"pp.":[17],"293--315],":[18],"who":[19],"described":[20],"these":[21,38],"small-":[24],"to":[25,40],"moderate-sized":[26],"problems.":[27,45],"The":[28],"major":[29],"contribution":[30],"of":[31,37,53,76],"this":[32],"paper":[33],"is":[34,84,89],"the":[35,55,60,79,82],"extension":[36,47],"large,":[41,65],"sparse":[42,66],"This":[46],"requires":[48],"an":[49],"entirely":[50],"new":[51],"way":[52],"solving":[54,64],"tensor":[56,95],"model":[57],"that":[58,94],"makes":[59],"suitable":[62],"problems":[68,77],"efficiently.":[69],"We":[70],"present":[71],"test":[72],"results":[73,92],"sets":[75],"where":[78,87],"Hessian":[80],"at":[81],"minimizer":[83],"nonsingular":[85],"it":[88],"singular.":[90],"These":[91],"show":[93],"are":[97],"significantly":[98],"more":[99,102],"efficient":[100],"reliable":[103],"than":[104],"standard":[105],"based":[107],"on":[108],"Newton's":[109],"method.":[110]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-10T08:33:47.465468","created_date":"2025-10-10T00:00:00"}