{"id":"https://openalex.org/W2726063369","doi":"https://doi.org/10.1051/ro/2017054","title":"Nonmonotone conic trust region method with line search technique for bound constrained optimization","display_name":"Nonmonotone conic trust region method with line search technique for bound constrained optimization","publication_year":2017,"publication_date":"2017-06-27","ids":{"openalex":"https://openalex.org/W2726063369","doi":"https://doi.org/10.1051/ro/2017054","mag":"2726063369"},"language":"en","primary_location":{"id":"doi:10.1051/ro/2017054","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2017054","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","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/A5073655205","display_name":"Lijuan Zhao","orcid":"https://orcid.org/0000-0001-9489-863X"},"institutions":[{"id":"https://openalex.org/I4210090460","display_name":"Nanjing Institute of Railway Technology","ror":"https://ror.org/00ctyfm67","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210090460"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Lijuan Zhao","raw_affiliation_strings":["Department of Social Science Teaching, Nanjing Vocational Institute of Railway Technology, Nanjing 210031, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Social Science Teaching, Nanjing Vocational Institute of Railway Technology, Nanjing 210031, China","institution_ids":["https://openalex.org/I4210090460"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073655205"],"corresponding_institution_ids":["https://openalex.org/I4210090460"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.11418685,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"53","issue":"3","first_page":"787","last_page":"805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9947999715805054,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9854999780654907,"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.9581453800201416},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.8220045566558838},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7178623676300049},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7043240070343018},{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.5604506731033325},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.5321993231773376},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.5169517397880554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4783589243888855},{"id":"https://openalex.org/keywords/series","display_name":"Series (stratigraphy)","score":0.4591907560825348},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.4352051913738251},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4269815683364868},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4219121038913727}],"concepts":[{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.9581453800201416},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.8220045566558838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7178623676300049},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7043240070343018},{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.5604506731033325},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.5321993231773376},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5169517397880554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4783589243888855},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4591907560825348},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.4352051913738251},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4269815683364868},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4219121038913727},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"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/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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro/2017054","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro/2017054","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2019__53_3_787_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro/2017054/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1586056472","https://openalex.org/W1748199557","https://openalex.org/W1969991107","https://openalex.org/W1973789597","https://openalex.org/W1982391474","https://openalex.org/W1983691524","https://openalex.org/W1984463182","https://openalex.org/W1984687314","https://openalex.org/W1986742476","https://openalex.org/W1994556784","https://openalex.org/W2009018340","https://openalex.org/W2011946467","https://openalex.org/W2015103152","https://openalex.org/W2025472175","https://openalex.org/W2026294088","https://openalex.org/W2043430160","https://openalex.org/W2048221927","https://openalex.org/W2056293789","https://openalex.org/W2059335309","https://openalex.org/W2066205820","https://openalex.org/W2066217924","https://openalex.org/W2071467620","https://openalex.org/W2079471071","https://openalex.org/W2089333839","https://openalex.org/W2094960695","https://openalex.org/W2125762761","https://openalex.org/W2126328535","https://openalex.org/W2144816722","https://openalex.org/W2145958546","https://openalex.org/W2149454052","https://openalex.org/W2155930105","https://openalex.org/W2167137033","https://openalex.org/W2507740005","https://openalex.org/W2525911200","https://openalex.org/W4240022917","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W2058731384","https://openalex.org/W2107915509","https://openalex.org/W2204405059","https://openalex.org/W2080108722","https://openalex.org/W2039676703","https://openalex.org/W2526664560","https://openalex.org/W2393058368","https://openalex.org/W2091091836","https://openalex.org/W2914606650","https://openalex.org/W2368213454"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,40,56,101],"nonmonotone":[6],"trust":[7,29,53,72],"region":[8,30,54,73],"method":[9],"for":[10],"bound":[11],"constrained":[12],"optimization":[13],"problems,":[14],"where":[15],"the":[16,27,32,45,51,71,78,90,111,114],"bounds":[17],"are":[18,92,107],"dealt":[19],"with":[20],"by":[21,50],"affine":[22],"scaling":[23],"technique.":[24],"Differing":[25],"from":[26],"traditional":[28],"methods,":[31],"subproblem":[33],"in":[34],"our":[35],"algorithm":[36,91],"is":[37,60],"based":[38],"on":[39,100],"conic":[41],"model.":[42],"Moreover,":[43],"when":[44],"trial":[46],"point":[47],"isn\u2019t":[48],"acceptable":[49,65],"usual":[52],"criterion,":[55],"line":[57],"search":[58],"technique":[59],"used":[61],"to":[62,109],"find":[63],"an":[64],"point.":[66],"This":[67],"procedure":[68],"avoids":[69],"resolving":[70],"subproblem,":[74],"which":[75],"may":[76],"reduce":[77],"total":[79],"computational":[80],"cost.":[81],"The":[82],"global":[83],"convergence":[84,88],"and":[85],"Q":[86],"-superlinear":[87],"of":[89,103,113],"established":[93],"under":[94],"some":[95],"mild":[96],"conditions.":[97],"Numerical":[98],"results":[99],"series":[102],"standard":[104],"test":[105],"problems":[106],"reported":[108],"show":[110],"effectiveness":[112],"new":[115],"method.":[116]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-07T06:14:10.401900","created_date":"2025-10-10T00:00:00"}