{"id":"https://openalex.org/W2613089901","doi":"https://doi.org/10.1080/00207160.2017.1329530","title":"An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization","display_name":"An affine scaling interior trust-region method combining with nonmonotone line search filter technique for linear inequality constrained minimization","publication_year":2017,"publication_date":"2017-05-12","ids":{"openalex":"https://openalex.org/W2613089901","doi":"https://doi.org/10.1080/00207160.2017.1329530","mag":"2613089901"},"language":"en","primary_location":{"id":"doi:10.1080/00207160.2017.1329530","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2017.1329530","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","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/A5100380654","display_name":"Dan Li","orcid":"https://orcid.org/0000-0001-5545-3574"},"institutions":[{"id":"https://openalex.org/I21945476","display_name":"Shanghai Normal University","ror":"https://ror.org/01cxqmw89","country_code":"CN","type":"education","lineage":["https://openalex.org/I21945476"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dan Li","raw_affiliation_strings":["Mathematics and Science College, Shanghai Normal University, Shanghai, China"],"raw_orcid":"https://orcid.org/0000-0001-5545-3574","affiliations":[{"raw_affiliation_string":"Mathematics and Science College, Shanghai Normal University, Shanghai, China","institution_ids":["https://openalex.org/I21945476"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100965045","display_name":"Detong Zhu","orcid":null},"institutions":[{"id":"https://openalex.org/I21945476","display_name":"Shanghai Normal University","ror":"https://ror.org/01cxqmw89","country_code":"CN","type":"education","lineage":["https://openalex.org/I21945476"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Detong Zhu","raw_affiliation_strings":["Mathematics and Science College, Shanghai Normal University, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mathematics and Science College, Shanghai Normal University, Shanghai, China","institution_ids":["https://openalex.org/I21945476"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100965045"],"corresponding_institution_ids":["https://openalex.org/I21945476"],"apc_list":null,"apc_paid":null,"fwci":7.7961,"has_fulltext":false,"cited_by_count":75,"citation_normalized_percentile":{"value":0.98280802,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"95","issue":"8","first_page":"1494","last_page":"1526"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9995999932289124,"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.9995999932289124,"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.9902999997138977,"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.9574000239372253,"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/line-search","display_name":"Line search","score":0.8915051817893982},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.8314276933670044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6583672761917114},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6379542350769043},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5131824612617493},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4976244270801544},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4885779321193695},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.4788610637187958},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4722435176372528},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.4326649308204651},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.430019736289978},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4284169673919678},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.4222549796104431},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.32248473167419434},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.2905672788619995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2724122703075409}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.8915051817893982},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.8314276933670044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6583672761917114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6379542350769043},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5131824612617493},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4976244270801544},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4885779321193695},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.4788610637187958},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4722435176372528},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.4326649308204651},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.430019736289978},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4284169673919678},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.4222549796104431},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.32248473167419434},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2905672788619995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2724122703075409},{"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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/00207160.2017.1329530","is_oa":false,"landing_page_url":"https://doi.org/10.1080/00207160.2017.1329530","pdf_url":null,"source":{"id":"https://openalex.org/S124867444","display_name":"International Journal of Computer Mathematics","issn_l":"0020-7160","issn":["0020-7160","1026-7425","1029-0265"],"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":"International Journal of Computer Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G8324964907","display_name":null,"funder_award_id":"11371253","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1586056472","https://openalex.org/W1748199557","https://openalex.org/W1975252730","https://openalex.org/W1979603710","https://openalex.org/W1993523241","https://openalex.org/W2001239641","https://openalex.org/W2031439566","https://openalex.org/W2039676703","https://openalex.org/W2043430160","https://openalex.org/W2048221927","https://openalex.org/W2048799772","https://openalex.org/W2053643774","https://openalex.org/W2062042185","https://openalex.org/W2062989923","https://openalex.org/W2071467620","https://openalex.org/W2075184363","https://openalex.org/W2084741900","https://openalex.org/W2088765246","https://openalex.org/W2094879958","https://openalex.org/W2094921409","https://openalex.org/W2149454052","https://openalex.org/W2163914411","https://openalex.org/W2167991535","https://openalex.org/W4240022917"],"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/W2011946467"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"an":[3,50,61],"affine":[4],"scaling":[5,66],"interior":[6],"trust-region":[7,45,73],"method":[8],"in":[9,88,111],"association":[10],"with":[11,60,72],"nonmonotone":[12,69],"line":[13,76,114],"search":[14,77,115],"filter":[15,78,116],"technique":[16,79],"for":[17],"solving":[18],"nonlinear":[19],"optimization":[20],"problems":[21],"subject":[22,47],"to":[23,49,144],"linear":[24,40],"inequality":[25,41],"constraints.":[26],"Based":[27],"on":[28,133],"a":[29,44,57],"Newton":[30],"step":[31],"which":[32,101,129],"is":[33,53,99,127,130],"derived":[34],"from":[35],"the":[36,85,89,107,112,124,148],"complementarity":[37],"conditions":[38],"of":[39,91,123,147],"constrained":[42],"optimization,":[43],"subproblem":[46],"only":[48],"ellipsoidal":[51],"constraint":[52],"defined":[54],"by":[55],"minimizing":[56],"quadratic":[58,63],"model":[59],"appropriate":[62],"function":[64],"and":[65,75],"matrix.":[67],"The":[68,118,138],"schemes":[70],"combining":[71],"strategy":[74],"can":[80],"bring":[81],"about":[82],"speeding":[83],"up":[84],"convergence":[86,104,121],"progress":[87],"case":[90],"high":[92],"nonlinear.":[93],"A":[94],"new":[95],"backtracking":[96],"relevance":[97],"condition":[98,109],"given":[100],"assures":[102],"global":[103],"without":[105],"using":[106],"switching":[108],"used":[110],"traditional":[113],"technique.":[117],"fast":[119],"local":[120],"rate":[122],"proposed":[125,149],"algorithm":[126],"achieved":[128],"not":[131],"depending":[132],"any":[134],"external":[135],"restoration":[136],"procedure.":[137],"preliminary":[139],"numerical":[140],"experiments":[141],"are":[142],"reported":[143],"show":[145],"effectiveness":[146],"algorithm.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":17},{"year":2019,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}