{"id":"https://openalex.org/W2100755605","doi":"https://doi.org/10.1145/2801948.2802003","title":"An incorporation of trust region methods on LexOpt algorithm for unconstrained optimization","display_name":"An incorporation of trust region methods on LexOpt algorithm for unconstrained optimization","publication_year":2015,"publication_date":"2015-09-22","ids":{"openalex":"https://openalex.org/W2100755605","doi":"https://doi.org/10.1145/2801948.2802003","mag":"2100755605"},"language":"en","primary_location":{"id":"doi:10.1145/2801948.2802003","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2801948.2802003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Panhellenic Conference on Informatics","raw_type":"proceedings-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/A5004762385","display_name":"Christina D. Nikolakakou","orcid":"https://orcid.org/0000-0002-4841-0397"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Christina D. Nikolakakou","raw_affiliation_strings":["University of Patras, GR, Rio, Greece"],"affiliations":[{"raw_affiliation_string":"University of Patras, GR, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025128776","display_name":"T. N. Grapsa","orcid":null},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Theodoula N. Grapsa","raw_affiliation_strings":["University of Patras GR, Rio, Greece"],"affiliations":[{"raw_affiliation_string":"University of Patras GR, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082930735","display_name":"George Androulakis","orcid":"https://orcid.org/0000-0001-6369-2348"},"institutions":[{"id":"https://openalex.org/I174878644","display_name":"University of Patras","ror":"https://ror.org/017wvtq80","country_code":"GR","type":"education","lineage":["https://openalex.org/I174878644"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"George S. Androulakis","raw_affiliation_strings":["University of Patras GR, Rio, Greece"],"affiliations":[{"raw_affiliation_string":"University of Patras GR, Rio, Greece","institution_ids":["https://openalex.org/I174878644"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5004762385"],"corresponding_institution_ids":["https://openalex.org/I174878644"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09365498,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"30"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9902999997138977,"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.9902999997138977,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9857000112533569,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9642000198364258,"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/lexicographical-order","display_name":"Lexicographical order","score":0.6813508868217468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.670468807220459},{"id":"https://openalex.org/keywords/preprocessor","display_name":"Preprocessor","score":0.5669651627540588},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.5651013851165771},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5628540515899658},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5597640872001648},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5517287254333496},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5185530781745911},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.46398308873176575},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4542362093925476},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.44624748826026917},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3139609694480896},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.16881638765335083},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11273899674415588}],"concepts":[{"id":"https://openalex.org/C159254197","wikidata":"https://www.wikidata.org/wiki/Q1144915","display_name":"Lexicographical order","level":2,"score":0.6813508868217468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.670468807220459},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.5669651627540588},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.5651013851165771},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5628540515899658},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5597640872001648},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5517287254333496},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5185530781745911},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.46398308873176575},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4542362093925476},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44624748826026917},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3139609694480896},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.16881638765335083},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11273899674415588},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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/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.1145/2801948.2802003","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2801948.2802003","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th Panhellenic Conference on Informatics","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W11974643","https://openalex.org/W192313854","https://openalex.org/W620377436","https://openalex.org/W2028307454","https://openalex.org/W2044233129","https://openalex.org/W2068484625","https://openalex.org/W2092802767","https://openalex.org/W2582743722","https://openalex.org/W3029645440","https://openalex.org/W4300448178","https://openalex.org/W6600490550","https://openalex.org/W6733261796","https://openalex.org/W6842097421"],"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":{"The":[0,165],"LexOpt":[1,134],"and":[2,116,122,174],"the":[3,15,19,36,40,48,65,70,73,83,86,93,96,100,106,111,128,142,168],"TLSO":[4],"algorithms":[5,13],"have":[6],"been":[7],"proposed":[8,88,170],"for":[9,85],"unconstrained":[10],"optimization.":[11],"These":[12],"transform":[14],"problem":[16,29],"of":[17,45,50,95,99,108,119,144,157,167],"minimizing":[18],"objective":[20],"function":[21],"into":[22],"an":[23,57],"equivalent":[24],"Lexicographic":[25],"Multiobjective":[26],"Optimization":[27],"(LMO)":[28],"whose":[30],"final":[31],"(sub-)problem":[32],"is":[33,61,92,114,148,163,172],"identical":[34],"to":[35,64],"given":[37,66],"one,":[38],"while":[39],"others":[41],"are":[42,76,184],"proper":[43,160],"approximations":[44],"it.":[46],"In":[47,80],"implementation":[49],"these":[51],"algorithms,":[52],"a":[53,117,123,138,155,159],"preprocessing":[54,74,112],"step":[55,75,113],"produces":[56],"initial":[58,150,161],"point":[59,140],"that":[60],"then":[62],"fed":[63],"optimization":[67],"problem.":[68],"All":[69],"problems":[71,109,183],"in":[72,110,133,141,152,179],"not":[77],"optimized":[78],"exhaustively.":[79],"this":[81,104,153],"paper":[82,154],"motivation":[84],"new":[87,169],"algorithm,":[89],"named":[90],"TrustLex-Opt,":[91],"reduction":[94],"computational":[97],"cost":[98],"above":[101],"algorithms.":[102],"To":[103],"end,":[105],"number":[107],"reduced":[115],"combination":[118],"trust":[120,145],"region":[121,146],"line":[124,130],"search":[125,131],"method":[126,132],"substitutes":[127],"utilized":[129],"algorithm.":[135],"Furthermore,":[136],"since":[137],"key":[139],"usage":[143],"methods":[147],"their":[149],"radius,":[151],"way":[156],"defining":[158],"radius":[162],"proposed.":[164],"convergence":[166],"algorithm":[171],"proved":[173],"preliminary":[175],"promising":[176],"numerical":[177],"results":[178],"well":[180],"known":[181],"test":[182],"presented.":[185]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}