{"id":"https://openalex.org/W147998453","doi":"https://doi.org/10.1137/1.9780898719857","title":"Trust Region Methods","display_name":"Trust Region Methods","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W147998453","doi":"https://doi.org/10.1137/1.9780898719857","mag":"147998453"},"language":"en","primary_location":{"id":"doi:10.1137/1.9780898719857","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9780898719857","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},"type":"book","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/A5103149740","display_name":"Andrew R. Conn","orcid":"https://orcid.org/0000-0001-7470-1035"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew R. Conn","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007869277","display_name":"Nicholas I. M. Gould","orcid":"https://orcid.org/0000-0002-1031-1588"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicholas I. M. Gould","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5002913605","display_name":"Philippe L. Toint","orcid":"https://orcid.org/0000-0002-6166-1860"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Philippe L. Toint","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matique","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.1386,"has_fulltext":false,"cited_by_count":2960,"citation_normalized_percentile":{"value":0.94897959,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9725000262260437,"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.9725000262260437,"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/computer-science","display_name":"Computer science","score":0.37178659439086914}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37178659439086914}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/1.9780898719857","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9780898719857","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"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":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":null,"raw_type":"monograph"},{"id":"pmh:oai:aleph.bib-bvb.de:BVB01-009176821","is_oa":false,"landing_page_url":"https://bvbr.bib-bvb.de:443/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009176821&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/09e4e32d-18ae-4d9f-ac69-6046c0cf4a06","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/09e4e32d-18ae-4d9f-ac69-6046c0cf4a06","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Conn, A, Gould, N & Toint, P 2000, Trust-region methods. MPS/SIAM Series on Optimization, SIAM, Philadelphia (Pa.).","raw_type":"book"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2382290278","https://openalex.org/W2350741829","https://openalex.org/W2130043461","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"This":[0],"is":[1,22],"the":[2,14,40,52,93,99],"first":[3],"comprehensive":[4],"reference":[5],"on":[6],"trust-region":[7],"methods,":[8],"a":[9,23],"class":[10],"of":[11,16,39,98],"algorithms":[12],"for":[13,48],"solution":[15],"nonlinear":[17],"nonconvex":[18],"optimization":[19],"problems.":[20],"It":[21],"unified":[24],"treatment":[25,97],"that":[26],"covers":[27],"both":[28],"unconstrained":[29],"and":[30,37,50,73,80,95],"constrained":[31],"problems,":[32],"including":[33,86],"many":[34,84],"specialised":[35],"topics":[36,101],"reviews":[38],"literature":[41],"not":[42],"easily":[43],"obtained":[44],"elsewhere.":[45],"Written":[46],"primarily":[47],"post-graduates":[49],"researchers,":[51],"book":[53,67],"features":[54],"an":[55,74],"extensive":[56],"commented":[57],"bibliography,":[58],"which":[59],"contains":[60,69],"972":[61],"references":[62],"by":[63],"745":[64],"authors.":[65],"The":[66],"also":[68],"several":[70],"practical":[71],"comments":[72],"entire":[75],"chapter":[76],"devoted":[77],"to":[78,91],"software":[79],"implementation":[81],"issues.":[82],"Its":[83],"illustrations,":[85],"nearly":[87],"100":[88],"figures,":[89],"helps":[90],"make":[92],"formal":[94],"in-depth":[96],"presented":[100],"more":[102],"accessible.":[103]},"counts_by_year":[{"year":2026,"cited_by_count":45},{"year":2025,"cited_by_count":132},{"year":2024,"cited_by_count":156},{"year":2023,"cited_by_count":148},{"year":2022,"cited_by_count":154},{"year":2021,"cited_by_count":166},{"year":2020,"cited_by_count":162},{"year":2019,"cited_by_count":166},{"year":2018,"cited_by_count":178},{"year":2017,"cited_by_count":146},{"year":2016,"cited_by_count":150},{"year":2015,"cited_by_count":150},{"year":2014,"cited_by_count":152},{"year":2013,"cited_by_count":141},{"year":2012,"cited_by_count":145}],"updated_date":"2026-06-23T13:55:30.953635","created_date":"2025-10-10T00:00:00"}
