{"id":"https://openalex.org/W1983911994","doi":"https://doi.org/10.1080/10556788.2015.1025403","title":"Descent direction method with line search for unconstrained optimization in noisy environment","display_name":"Descent direction method with line search for unconstrained optimization in noisy environment","publication_year":2015,"publication_date":"2015-04-30","ids":{"openalex":"https://openalex.org/W1983911994","doi":"https://doi.org/10.1080/10556788.2015.1025403","mag":"1983911994"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2015.1025403","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1025403","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","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/A5029757006","display_name":"Nata\u0161a Kreji\u0107","orcid":"https://orcid.org/0000-0003-3348-7233"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Nata\u0161a Kreji\u0107","raw_affiliation_strings":["Department of Mathematics and Informatics, Faculty of Science, University of Novi Sad, Trg Dositeja Obradovi\u0107a 4, 21000Novi Sad, Serbia#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Informatics, Faculty of Science, University of Novi Sad, Trg Dositeja Obradovi\u0107a 4, 21000Novi Sad, Serbia#TAB#","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016058361","display_name":"Zorana Lu\u017eanin","orcid":"https://orcid.org/0000-0002-7215-2252"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Zorana Lu\u017eanin","raw_affiliation_strings":["Department of Mathematics and Informatics, Faculty of Science, University of Novi Sad, Trg Dositeja Obradovi\u0107a 4, 21000Novi Sad, Serbia#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Informatics, Faculty of Science, University of Novi Sad, Trg Dositeja Obradovi\u0107a 4, 21000Novi Sad, Serbia#TAB#","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058704267","display_name":"Zoran Ovcin","orcid":"https://orcid.org/0000-0002-4097-8797"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Zoran Ovcin","raw_affiliation_strings":["Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovi\u0107a 6, 21000Novi Sad, Serbia#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovi\u0107a 6, 21000Novi Sad, Serbia#TAB#","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089362361","display_name":"Irena Stojkovska","orcid":"https://orcid.org/0000-0003-0983-8558"},"institutions":[{"id":"https://openalex.org/I76245029","display_name":"Saints Cyril and Methodius University of Skopje","ror":"https://ror.org/02wk2vx54","country_code":"MK","type":"education","lineage":["https://openalex.org/I76245029"]}],"countries":["MK"],"is_corresponding":false,"raw_author_name":"Irena Stojkovska","raw_affiliation_strings":["Department of Mathematics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University, Arhimedova 3, 1000Skopje, Macedonia#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Natural Sciences and Mathematics, Ss. Cyril and Methodius University, Arhimedova 3, 1000Skopje, Macedonia#TAB#","institution_ids":["https://openalex.org/I76245029"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029757006"],"corresponding_institution_ids":["https://openalex.org/I170726198"],"apc_list":null,"apc_paid":null,"fwci":1.2995,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.78496854,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"6","first_page":"1164","last_page":"1184"},"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.9994000196456909,"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.9994000196456909,"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.9983999729156494,"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/T11233","display_name":"Advanced Adaptive Filtering Techniques","score":0.9976999759674072,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.7212918996810913},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.6151754260063171},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5597091317176819},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5474019050598145},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5383234024047852},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4929211139678955},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3707857131958008},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.31887465715408325},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2605634331703186},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14521870017051697},{"id":"https://openalex.org/keywords/aerospace-engineering","display_name":"Aerospace engineering","score":0.06230565905570984}],"concepts":[{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7212918996810913},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.6151754260063171},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5597091317176819},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5474019050598145},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5383234024047852},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4929211139678955},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3707857131958008},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.31887465715408325},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2605634331703186},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14521870017051697},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.06230565905570984},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2015.1025403","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2015.1025403","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"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":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W40564758","https://openalex.org/W179214035","https://openalex.org/W203276351","https://openalex.org/W1491622225","https://openalex.org/W1501203061","https://openalex.org/W1519752295","https://openalex.org/W1971942712","https://openalex.org/W1986294906","https://openalex.org/W1991083751","https://openalex.org/W1991701290","https://openalex.org/W1994616650","https://openalex.org/W1996235804","https://openalex.org/W2012341322","https://openalex.org/W2032733195","https://openalex.org/W2044932436","https://openalex.org/W2056603712","https://openalex.org/W2059635037","https://openalex.org/W2060820585","https://openalex.org/W2061570747","https://openalex.org/W2064076655","https://openalex.org/W2065450730","https://openalex.org/W2068484625","https://openalex.org/W2080335539","https://openalex.org/W2089104597","https://openalex.org/W2098733422","https://openalex.org/W2098840904","https://openalex.org/W2126964567","https://openalex.org/W2137762232","https://openalex.org/W2149454052","https://openalex.org/W2153329740","https://openalex.org/W2497446532","https://openalex.org/W2565654137","https://openalex.org/W2734870733","https://openalex.org/W2963941964","https://openalex.org/W3029645440","https://openalex.org/W3118870036","https://openalex.org/W4293775970"],"related_works":["https://openalex.org/W3080334989","https://openalex.org/W1998295157","https://openalex.org/W2015288657","https://openalex.org/W2366552965","https://openalex.org/W4226095963","https://openalex.org/W2372778757","https://openalex.org/W4377090276","https://openalex.org/W2364567920","https://openalex.org/W1994778783","https://openalex.org/W2740262376"],"abstract_inverted_index":{"A":[0,12],"two-phase":[1],"descent":[2,18,56],"direction":[3,19,57],"method":[4,14,49,96],"for":[5,55,64,97],"unconstrained":[6],"stochastic":[7,37],"optimization":[8],"problem":[9],"is":[10,20,50],"proposed.":[11],"line-search":[13,69],"with":[15,84],"an":[16],"arbitrary":[17],"used":[21,63],"to":[22],"determine":[23],"the":[24,28,32,36,47,75,85,94],"step":[25,40],"sizes":[26],"during":[27],"initial":[29],"phase,":[30],"and":[31,58,78],"second":[33],"phase":[34],"performs":[35],"approximation":[38],"SA":[39,59,86],"sizes.":[41],"The":[42,61],"almost":[43],"sure":[44],"convergence":[45],"of":[46,93],"proposed":[48,95],"established,":[51],"under":[52],"standard":[53],"assumption":[54],"methods.":[60],"algorithm":[62],"practical":[65],"implementation":[66],"combines":[67],"a":[68],"quasi-Newton":[70],"QN":[71],"method,":[72],"in":[73],"particular":[74],"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno":[76],"BFGS":[77],"Symmetric":[79],"Rank":[80],"1":[81],"SR1":[82],"methods,":[83],"iterations.":[87],"Numerical":[88],"results":[89],"show":[90],"good":[91],"performance":[92],"different":[98],"noise":[99],"levels.":[100]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}