{"id":"https://openalex.org/W2064212282","doi":"https://doi.org/10.1080/10556780500094754","title":"Matrix-free algorithm for the large-scale constrained trust-region subproblem","display_name":"Matrix-free algorithm for the large-scale constrained trust-region subproblem","publication_year":2005,"publication_date":"2005-11-29","ids":{"openalex":"https://openalex.org/W2064212282","doi":"https://doi.org/10.1080/10556780500094754","mag":"2064212282"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500094754","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500094754","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5011525108","display_name":"Anthony J. Kearsley","orcid":"https://orcid.org/0000-0002-9576-0621"},"institutions":[{"id":"https://openalex.org/I1321296531","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416","country_code":"US","type":"funder","lineage":["https://openalex.org/I1321296531","https://openalex.org/I1343035065"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Anthony J. Kearsley","raw_affiliation_strings":["Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, MD, 20899-8910, USA","Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, MD 20899-8910, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, MD, 20899-8910, USA","institution_ids":["https://openalex.org/I1321296531"]},{"raw_affiliation_string":"Mathematical and Computational Sciences Division, National Institute of Standards and Technology, Gaithersburg, MD 20899-8910, USA#TAB#","institution_ids":["https://openalex.org/I1321296531"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5011525108"],"corresponding_institution_ids":["https://openalex.org/I1321296531"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.15037272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"21","issue":"2","first_page":"233","last_page":"245"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10792","display_name":"Matrix Theory and Algorithms","score":1.0,"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":1.0,"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.9998000264167786,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9948999881744385,"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.7182299494743347},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.6738601922988892},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5346310138702393},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.529249370098114},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44658735394477844},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44349002838134766},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.43450745940208435},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38256555795669556},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06973811984062195},{"id":"https://openalex.org/keywords/materials-science","display_name":"Materials science","score":0.059027791023254395}],"concepts":[{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.7182299494743347},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.6738601922988892},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5346310138702393},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.529249370098114},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44658735394477844},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44349002838134766},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.43450745940208435},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38256555795669556},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06973811984062195},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.059027791023254395},{"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/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780500094754","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500094754","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W340307193","https://openalex.org/W1506690472","https://openalex.org/W1509805685","https://openalex.org/W1518039036","https://openalex.org/W1979603710","https://openalex.org/W1994666506","https://openalex.org/W2000389939","https://openalex.org/W2014746566","https://openalex.org/W2015530812","https://openalex.org/W2058885431","https://openalex.org/W2059164920","https://openalex.org/W2062546867","https://openalex.org/W2063690908","https://openalex.org/W2069101571","https://openalex.org/W2069262775","https://openalex.org/W2075184363","https://openalex.org/W2077787996","https://openalex.org/W2080641403","https://openalex.org/W2100738870","https://openalex.org/W2143211330","https://openalex.org/W2163055580","https://openalex.org/W2313519353","https://openalex.org/W2326806701","https://openalex.org/W2733179301","https://openalex.org/W2798766386","https://openalex.org/W3003775594","https://openalex.org/W4254313632"],"related_works":["https://openalex.org/W2752681920","https://openalex.org/W2080108722","https://openalex.org/W4387560237","https://openalex.org/W4285148873","https://openalex.org/W1970330626","https://openalex.org/W2076468490","https://openalex.org/W2081219400","https://openalex.org/W2805810264","https://openalex.org/W2384787007","https://openalex.org/W2557895864"],"abstract_inverted_index":{"A":[0],"new":[1],"\u2018matrix-free\u2019":[2],"algorithm":[3,21],"for":[4,25],"the":[5,20,23,38,41],"solution":[6],"of":[7,19,40],"linear":[8],"inequality":[9],"constrained,":[10],"large-scale":[11],"trust-region":[12],"subproblems":[13],"is":[14],"presented.":[15],"The":[16],"matrix-free":[17],"nature":[18],"eliminates":[22],"need":[24],"any":[26],"matrix":[27],"factorizations":[28],"and":[29],"only":[30],"requires":[31],"matrix\u2013vector":[32],"products.":[33],"Numerical":[34],"results":[35],"that":[36],"demonstrate":[37],"viability":[39],"approach":[42],"are":[43],"included.":[44]},"counts_by_year":[{"year":2019,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}