{"id":"https://openalex.org/W3200785117","doi":"https://doi.org/10.1007/s11590-021-01794-1","title":"A matrix-free trust-region newton algorithm for convex-constrained optimization","display_name":"A matrix-free trust-region newton algorithm for convex-constrained optimization","publication_year":2021,"publication_date":"2021-09-17","ids":{"openalex":"https://openalex.org/W3200785117","doi":"https://doi.org/10.1007/s11590-021-01794-1","mag":"3200785117"},"language":"en","primary_location":{"id":"doi:10.1007/s11590-021-01794-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-021-01794-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","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/A5054813354","display_name":"Drew Kouri","orcid":"https://orcid.org/0000-0002-7079-3195"},"institutions":[{"id":"https://openalex.org/I192454743","display_name":"Sandia National Laboratories California","ror":"https://ror.org/058m7ey48","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1330989302","https://openalex.org/I192454743","https://openalex.org/I198811213","https://openalex.org/I198811213","https://openalex.org/I4210104735"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"D. P. Kouri","raw_affiliation_strings":["Optimization and Uncertainty Quantification, Sandia National Laboratories, P.O. Box 5800, MS-1320, Albuquerque, NM, 87185-1320, United States"],"raw_orcid":"https://orcid.org/0000-0002-7079-3195","affiliations":[{"raw_affiliation_string":"Optimization and Uncertainty Quantification, Sandia National Laboratories, P.O. Box 5800, MS-1320, Albuquerque, NM, 87185-1320, United States","institution_ids":["https://openalex.org/I192454743"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054813354"],"corresponding_institution_ids":["https://openalex.org/I192454743"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.2465,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.76682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"16","issue":"3","first_page":"983","last_page":"997"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9994999766349792,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.8477553129196167},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6871018409729004},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.6351428627967834},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5977892875671387},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.5826448202133179},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5655691623687744},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5278095006942749},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523565948009491},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.49286818504333496},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4900158941745758},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4493674039840698},{"id":"https://openalex.org/keywords/computational-intelligence","display_name":"Computational intelligence","score":0.43059319257736206},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41708946228027344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4028623402118683},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.28862079977989197},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10128101706504822}],"concepts":[{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.8477553129196167},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6871018409729004},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.6351428627967834},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5977892875671387},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.5826448202133179},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5655691623687744},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5278095006942749},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523565948009491},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.49286818504333496},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4900158941745758},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4493674039840698},{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.43059319257736206},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41708946228027344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4028623402118683},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.28862079977989197},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10128101706504822},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11590-021-01794-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11590-021-01794-1","pdf_url":null,"source":{"id":"https://openalex.org/S12647387","display_name":"Optimization Letters","issn_l":"1862-4472","issn":["1862-4472","1862-4480"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3823894852","display_name":null,"funder_award_id":"F4FGA09135G001","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W1520067009","https://openalex.org/W1575923498","https://openalex.org/W1820125862","https://openalex.org/W1973734200","https://openalex.org/W1975383645","https://openalex.org/W1979382551","https://openalex.org/W1991907403","https://openalex.org/W1994603587","https://openalex.org/W1995202706","https://openalex.org/W2000218110","https://openalex.org/W2001858025","https://openalex.org/W2003105834","https://openalex.org/W2003179943","https://openalex.org/W2004266074","https://openalex.org/W2011115073","https://openalex.org/W2014252818","https://openalex.org/W2023320048","https://openalex.org/W2035741312","https://openalex.org/W2042613327","https://openalex.org/W2078950386","https://openalex.org/W2088106105","https://openalex.org/W2102790339","https://openalex.org/W2118163005","https://openalex.org/W2143163345","https://openalex.org/W2150911263","https://openalex.org/W2153635508","https://openalex.org/W2156909104","https://openalex.org/W2337100231","https://openalex.org/W3120740533","https://openalex.org/W3155932456","https://openalex.org/W4230674625","https://openalex.org/W4251821343"],"related_works":["https://openalex.org/W2385407215","https://openalex.org/W1512804140","https://openalex.org/W2388821964","https://openalex.org/W2951335402","https://openalex.org/W2993933029","https://openalex.org/W2589063463","https://openalex.org/W3200785117","https://openalex.org/W2916268394","https://openalex.org/W3202062745","https://openalex.org/W4301121782"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}