{"id":"https://openalex.org/W3137421758","doi":"https://doi.org/10.1137/19m1279691","title":"The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem","display_name":"The Convergence of the Generalized Lanczos Trust-Region Method for the Trust-Region Subproblem","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3137421758","doi":"https://doi.org/10.1137/19m1279691","mag":"3137421758"},"language":"en","primary_location":{"id":"doi:10.1137/19m1279691","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1279691","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/A5075378610","display_name":"Zhongxiao Jia","orcid":"https://orcid.org/0000-0001-9761-8517"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongxiao Jia","raw_affiliation_strings":["Corresponding author. Department of Mathematical Sciences, Tsinghua University, 100084 Bei-jing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Corresponding author. Department of Mathematical Sciences, Tsinghua University, 100084 Bei-jing, China","institution_ids":["https://openalex.org/I99065089"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100702418","display_name":"Fa Wang","orcid":"https://orcid.org/0000-0003-1607-2837"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Fa Wang","raw_affiliation_strings":["Department of Mathematical Sciences, Tsinghua University, 100084 Beijing, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences, Tsinghua University, 100084 Beijing, China","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I99065089"],"apc_list":null,"apc_paid":null,"fwci":0.9136,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.77820876,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"31","issue":"1","first_page":"887","last_page":"914"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":0.9998999834060669,"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9994999766349792,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.8778270483016968},{"id":"https://openalex.org/keywords/lanczos-resampling","display_name":"Lanczos resampling","score":0.8252959251403809},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7370158433914185},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.6934244632720947},{"id":"https://openalex.org/keywords/residual","display_name":"Residual","score":0.6633979082107544},{"id":"https://openalex.org/keywords/orthonormal-basis","display_name":"Orthonormal basis","score":0.6529762744903564},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.5990406274795532},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5660555362701416},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.524820864200592},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5170148611068726},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4892411231994629},{"id":"https://openalex.org/keywords/symbolic-convergence-theory","display_name":"Symbolic convergence theory","score":0.4507191777229309},{"id":"https://openalex.org/keywords/lanczos-algorithm","display_name":"Lanczos algorithm","score":0.4168534576892853},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20435062050819397},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1806815266609192},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.16872954368591309},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09012573957443237},{"id":"https://openalex.org/keywords/eigenvalues-and-eigenvectors","display_name":"Eigenvalues and eigenvectors","score":0.06946083903312683}],"concepts":[{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.8778270483016968},{"id":"https://openalex.org/C119256216","wikidata":"https://www.wikidata.org/wiki/Q913012","display_name":"Lanczos resampling","level":3,"score":0.8252959251403809},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7370158433914185},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.6934244632720947},{"id":"https://openalex.org/C155512373","wikidata":"https://www.wikidata.org/wiki/Q287450","display_name":"Residual","level":2,"score":0.6633979082107544},{"id":"https://openalex.org/C5806529","wikidata":"https://www.wikidata.org/wiki/Q2365325","display_name":"Orthonormal basis","level":2,"score":0.6529762744903564},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5990406274795532},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5660555362701416},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.524820864200592},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5170148611068726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4892411231994629},{"id":"https://openalex.org/C64980692","wikidata":"https://www.wikidata.org/wiki/Q16191959","display_name":"Symbolic convergence theory","level":3,"score":0.4507191777229309},{"id":"https://openalex.org/C20501136","wikidata":"https://www.wikidata.org/wiki/Q366640","display_name":"Lanczos algorithm","level":4,"score":0.4168534576892853},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20435062050819397},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1806815266609192},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.16872954368591309},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09012573957443237},{"id":"https://openalex.org/C158693339","wikidata":"https://www.wikidata.org/wiki/Q190524","display_name":"Eigenvalues and eigenvectors","level":2,"score":0.06946083903312683},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/19m1279691","is_oa":false,"landing_page_url":"https://doi.org/10.1137/19m1279691","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2895962212","display_name":null,"funder_award_id":"11771249","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1965278079","https://openalex.org/W1974888421","https://openalex.org/W1990972291","https://openalex.org/W1994666506","https://openalex.org/W2000389939","https://openalex.org/W2026079992","https://openalex.org/W2040055413","https://openalex.org/W2058885431","https://openalex.org/W2063690908","https://openalex.org/W2075184363","https://openalex.org/W2080641403","https://openalex.org/W2080851285","https://openalex.org/W2086079401","https://openalex.org/W2101734906","https://openalex.org/W2106190681","https://openalex.org/W2119842211","https://openalex.org/W2153978753","https://openalex.org/W2157725068","https://openalex.org/W2160064536","https://openalex.org/W2591505158","https://openalex.org/W2759377581","https://openalex.org/W2790033792","https://openalex.org/W3098215756","https://openalex.org/W4210599947"],"related_works":["https://openalex.org/W2156009096","https://openalex.org/W3176451595","https://openalex.org/W2027838537","https://openalex.org/W1970812947","https://openalex.org/W2058241770","https://openalex.org/W1980579360","https://openalex.org/W4243541541","https://openalex.org/W2095282848","https://openalex.org/W4248073715","https://openalex.org/W2550228252"],"abstract_inverted_index":{"Solving":[0],"the":[1,36,54,63,75,78,87,97,100,105,113,124,130,133,138,150,153,170,188,192],"trust-region":[2,19],"subproblem":[3],"(TRS)":[4],"plays":[5],"a":[6,23,30,41,70,92,119,139],"key":[7],"role":[8],"in":[9,132,161],"numerical":[10],"optimization":[11],"and":[12,58,81,104,149,164,186],"many":[13],"other":[14,173],"applications.":[15],"The":[16,33],"generalized":[17],"Lanczos":[18,25,56],"(GLTR)":[20],"method":[21,34,126],"is":[22,127,157],"well-known":[24],"type":[26],"approach":[27],"for":[28,74,129,142,152],"solving":[29],"large-scale":[31,38],"TRS.":[32],"projects":[35],"original":[37],"TRS":[39,131],"onto":[40],"sequence":[42],"of":[43,77,99,108,123,158,172,191],"lower":[44],"dimensional":[45],"Krylov":[46],"subspaces,":[47],"whose":[48],"orthonormal":[49],"bases":[50],"are":[51,146,184],"generated":[52],"by":[53,86,112],"symmetric":[55],"process,":[57],"computes":[59],"approximate":[60,79,82,101,109],"solutions":[61,80,110],"from":[62],"underlying":[64],"subspaces.":[65],"There":[66],"have":[67],"been":[68],"some":[69],"priori":[71,93,140],"bounds":[72,141,183],"available":[73],"errors":[76,98,176],"objective":[83],"values":[84],"obtained":[85,111],"GLTR":[88,114,125],"method,":[89],"but":[90],"no":[91],"bound":[94],"exists":[95],"on":[96],"Lagrangian":[102],"multipliers":[103],"residual":[106,155],"norms":[107],"method.":[115],"In":[116],"this":[117],"paper,":[118],"general":[120],"convergence":[121,189],"theory":[122,163],"established":[128],"easy":[134],"case,":[135],"showing":[136],"that":[137,181],"these":[143],"four":[144,193],"quantities":[145,194],"closely":[147],"interrelated":[148],"one":[151],"computable":[154],"norm":[156],"crucial":[159],"importance":[160],"both":[162],"practice":[165],"as":[166],"it":[167],"can":[168],"predict":[169,187],"sizes":[171],"three":[174],"uncomputable":[175],"reliably.":[177],"Numerical":[178],"experiments":[179],"demonstrate":[180],"our":[182],"realistic":[185],"rates":[190],"accurately.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}