{"id":"https://openalex.org/W1995202706","doi":"https://doi.org/10.1137/0803009","title":"Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints","display_name":"Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W1995202706","doi":"https://doi.org/10.1137/0803009","mag":"1995202706"},"language":"en","primary_location":{"id":"doi:10.1137/0803009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803009","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":true,"oa_status":"green","oa_url":"https://researchportal.unamur.be/en/publications/e57f375d-12f7-4cb6-9b6d-e1e8a7f57d41","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5103149740","display_name":"Andrew R. Conn","orcid":"https://orcid.org/0000-0001-7470-1035"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. R. Conn","raw_affiliation_strings":["IBM T.J. Watson research Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nick Gould","orcid":null},"institutions":[{"id":"https://openalex.org/I1286704778","display_name":"Rutherford Appleton Laboratory","ror":"https://ror.org/03gq8fr08","country_code":"GB","type":"facility","lineage":["https://openalex.org/I1286704778","https://openalex.org/I162524378","https://openalex.org/I4210087105"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nick Gould","raw_affiliation_strings":["Rutherford Appleton Laboratory"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Rutherford Appleton Laboratory","institution_ids":["https://openalex.org/I1286704778"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108097617","display_name":"Annick Sartenaer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Sartenaer","raw_affiliation_strings":["D\u00e9partement de Math\u00e9matique"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"D\u00e9partement de Math\u00e9matique","institution_ids":[]}]},{"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":"Ph. 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":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2709,"has_fulltext":false,"cited_by_count":56,"citation_normalized_percentile":{"value":0.95318291,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":"1","first_page":"164","last_page":"221"},"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.998199999332428,"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.998199999332428,"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.998199999332428,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9801999926567078,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.7975221872329712},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7256981730461121},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7011494636535645},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6197603344917297},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5903311371803284},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5778589844703674},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5755048394203186},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5511209964752197},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5365540981292725},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5224232077598572},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5222152471542358},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5055825710296631},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46605926752090454},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4462750554084778},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4422382116317749},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.41597649455070496},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.41398027539253235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21848127245903015}],"concepts":[{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.7975221872329712},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7256981730461121},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7011494636535645},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6197603344917297},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5903311371803284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5778589844703674},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5755048394203186},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5511209964752197},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5365540981292725},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5224232077598572},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5222152471542358},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5055825710296631},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46605926752090454},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4462750554084778},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4422382116317749},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.41597649455070496},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.41398027539253235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21848127245903015},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0803009","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0803009","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:epubs.cclrc.ac.uk:work/39825","is_oa":false,"landing_page_url":"http://purl.org/net/epubs/work/39825","pdf_url":null,"source":{"id":"https://openalex.org/S4306400334","display_name":"Science and Technology Facilities Council","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":"","raw_type":"Text"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/e57f375d-12f7-4cb6-9b6d-e1e8a7f57d41","is_oa":true,"landing_page_url":"https://researchportal.unamur.be/en/publications/e57f375d-12f7-4cb6-9b6d-e1e8a7f57d41","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Conn, A, Gould, N, Sartenaer, A & Toint, P 1993, 'Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints', SIAM Journal on Optimization, vol. 3, no. 1, pp. 164-221.","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/e57f375d-12f7-4cb6-9b6d-e1e8a7f57d41","is_oa":true,"landing_page_url":"https://researchportal.unamur.be/en/publications/e57f375d-12f7-4cb6-9b6d-e1e8a7f57d41","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Conn, A, Gould, N, Sartenaer, A & Toint, P 1993, 'Global convergence of a class of trust region algorithms for optimization using inexact projections on convex constraints', SIAM Journal on Optimization, vol. 3, no. 1, pp. 164-221.","raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W135273259","https://openalex.org/W291003596","https://openalex.org/W1548713535","https://openalex.org/W1572204513","https://openalex.org/W1579664581","https://openalex.org/W1893275031","https://openalex.org/W1965776043","https://openalex.org/W1981648990","https://openalex.org/W1994603587","https://openalex.org/W2007014371","https://openalex.org/W2008063657","https://openalex.org/W2018557944","https://openalex.org/W2033758151","https://openalex.org/W2035741312","https://openalex.org/W2038904236","https://openalex.org/W2048221927","https://openalex.org/W2056950638","https://openalex.org/W2060279602","https://openalex.org/W2068484625","https://openalex.org/W2072808760","https://openalex.org/W2090243370","https://openalex.org/W2092679899","https://openalex.org/W2094879958","https://openalex.org/W2148589597","https://openalex.org/W2614333644","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W2050613758","https://openalex.org/W1555927645","https://openalex.org/W2119283772","https://openalex.org/W1548320777","https://openalex.org/W2098918699","https://openalex.org/W2058475249","https://openalex.org/W2378916131","https://openalex.org/W2352917547","https://openalex.org/W2400562750","https://openalex.org/W2376692113"],"abstract_inverted_index":{"A":[0],"class":[1,106],"of":[2,11,26,36,49,88,104,111],"trust":[3],"region-based":[4],"algorithms":[5,42,103],"is":[6,82],"presented":[7,31],"for":[8,33,78],"the":[9,29,34,40,46,50,61,64,79,86,97,102,105],"solution":[10,98],"nonlinear":[12,91],"optimization":[13],"problems":[14],"with":[15,22],"a":[16,108],"convex":[17],"feasible":[18,65],"set.":[19],"At":[20],"variance":[21],"previously":[23],"published":[24],"analyses":[25],"this":[27],"type,":[28],"theory":[30],"allows":[32],"use":[35],"general":[37],"norms.":[38],"Furthermore,":[39],"proposed":[41],"do":[43],"not":[44],"require":[45],"explicit":[47],"computation":[48],"projected":[51],"gradient,":[52],"and":[53,90],"can":[54],"therefore":[55],"be":[56,68],"adapted":[57],"to":[58,70],"cases":[59],"where":[60],"projection":[62],"onto":[63],"domain":[66],"may":[67],"expensive":[69],"calculate.":[71],"Strong":[72],"global":[73],"convergence":[74],"results":[75],"are":[76,94,99],"derived":[77],"class.":[80],"It":[81],"also":[83],"shown":[84],"that":[85,93],"set":[87],"linear":[89],"constraints":[92],"binding":[95],"at":[96],"identified":[100],"by":[101],"in":[107],"finite":[109],"number":[110],"iterations.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-23T13:55:30.953635","created_date":"2025-10-10T00:00:00"}