{"id":"https://openalex.org/W2014424370","doi":"https://doi.org/10.1007/s11075-009-9350-8","title":"Accelerated gradient descent methods with line search","display_name":"Accelerated gradient descent methods with line search","publication_year":2009,"publication_date":"2009-12-09","ids":{"openalex":"https://openalex.org/W2014424370","doi":"https://doi.org/10.1007/s11075-009-9350-8","mag":"2014424370"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-009-9350-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-009-9350-8","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","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/A5038736735","display_name":"Predrag S. Stanimirovi\u0107","orcid":"https://orcid.org/0000-0003-0655-3741"},"institutions":[{"id":"https://openalex.org/I152518017","display_name":"University of Nis","ror":"https://ror.org/00965bg92","country_code":"RS","type":"education","lineage":["https://openalex.org/I152518017"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Predrag S. Stanimirovi\u0107","raw_affiliation_strings":["Department of Mathematics, Faculty of Science, University of Ni\u0161, Vi\u0161egradska 33, 18000, Ni\u0161, Serbia","University of Ni\u0161"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Science, University of Ni\u0161, Vi\u0161egradska 33, 18000, Ni\u0161, Serbia","institution_ids":["https://openalex.org/I152518017"]},{"raw_affiliation_string":"University of Ni\u0161","institution_ids":["https://openalex.org/I152518017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023166758","display_name":"Marko Miladinovi\u0107","orcid":"https://orcid.org/0000-0003-0494-3201"},"institutions":[{"id":"https://openalex.org/I152518017","display_name":"University of Nis","ror":"https://ror.org/00965bg92","country_code":"RS","type":"education","lineage":["https://openalex.org/I152518017"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Marko B. Miladinovi\u0107","raw_affiliation_strings":["Department of Mathematics, Faculty of Science, University of Ni\u0161, Vi\u0161egradska 33, 18000, Ni\u0161, Serbia","University of Ni\u0161"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Faculty of Science, University of Ni\u0161, Vi\u0161egradska 33, 18000, Ni\u0161, Serbia","institution_ids":["https://openalex.org/I152518017"]},{"raw_affiliation_string":"University of Ni\u0161","institution_ids":["https://openalex.org/I152518017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.11678832,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"54","issue":"4","first_page":"503","last_page":"520"},"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9980000257492065,"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.9876000285148621,"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/mathematics","display_name":"Mathematics","score":0.793276309967041},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7892333269119263},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.7644915580749512},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.6124110817909241},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.5790482759475708},{"id":"https://openalex.org/keywords/diagonal","display_name":"Diagonal","score":0.5547964572906494},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.554130494594574},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5373327732086182},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5262738466262817},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.5237331390380859},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5152802467346191},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.49607929587364197},{"id":"https://openalex.org/keywords/nonlinear-conjugate-gradient-method","display_name":"Nonlinear conjugate gradient method","score":0.4908822178840637},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.48248934745788574},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.480059951543808},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.45812851190567017},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4493197202682495},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.4216490387916565},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.41668838262557983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3908576965332031},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.38121938705444336},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.3747560977935791},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.35338354110717773},{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.3308357298374176},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.23676899075508118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.16216611862182617},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.16065698862075806},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.1355220377445221},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.08361196517944336}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.793276309967041},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7892333269119263},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.7644915580749512},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.6124110817909241},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.5790482759475708},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.5547964572906494},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.554130494594574},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5373327732086182},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5262738466262817},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.5237331390380859},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5152802467346191},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.49607929587364197},{"id":"https://openalex.org/C26362088","wikidata":"https://www.wikidata.org/wiki/Q17086453","display_name":"Nonlinear conjugate gradient method","level":4,"score":0.4908822178840637},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.48248934745788574},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.480059951543808},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.45812851190567017},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4493197202682495},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.4216490387916565},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.41668838262557983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3908576965332031},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.38121938705444336},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.3747560977935791},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.35338354110717773},{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.3308357298374176},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.23676899075508118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.16216611862182617},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.16065698862075806},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.1355220377445221},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.08361196517944336},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","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},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11075-009-9350-8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-009-9350-8","pdf_url":null,"source":{"id":"https://openalex.org/S117494069","display_name":"Numerical Algorithms","issn_l":"1017-1398","issn":["1017-1398","1572-9265"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Numerical Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W54906651","https://openalex.org/W150175414","https://openalex.org/W173320072","https://openalex.org/W600585552","https://openalex.org/W613054787","https://openalex.org/W1497566274","https://openalex.org/W1969811075","https://openalex.org/W1982067912","https://openalex.org/W1982813377","https://openalex.org/W1983212821","https://openalex.org/W1988849934","https://openalex.org/W1989566487","https://openalex.org/W2012231377","https://openalex.org/W2012341322","https://openalex.org/W2014851363","https://openalex.org/W2039771911","https://openalex.org/W2045010238","https://openalex.org/W2050096287","https://openalex.org/W2062106836","https://openalex.org/W2070580109","https://openalex.org/W2076605490","https://openalex.org/W2081842231","https://openalex.org/W2090287784","https://openalex.org/W2090963365","https://openalex.org/W2091683542","https://openalex.org/W2091917610","https://openalex.org/W2099607078","https://openalex.org/W2266946488","https://openalex.org/W2326893138","https://openalex.org/W2340930132","https://openalex.org/W3141890267","https://openalex.org/W4249667877","https://openalex.org/W4291236916"],"related_works":["https://openalex.org/W2615612939","https://openalex.org/W2390763588","https://openalex.org/W4200512840","https://openalex.org/W2065000345","https://openalex.org/W2761098424","https://openalex.org/W241553812","https://openalex.org/W2563719283","https://openalex.org/W2745588084","https://openalex.org/W4322495452","https://openalex.org/W2014424370"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}