{"id":"https://openalex.org/W2986160164","doi":"https://doi.org/10.1007/s11075-020-00987-6","title":"A generalized worst-case complexity analysis for non-monotone line searches","display_name":"A generalized worst-case complexity analysis for non-monotone line searches","publication_year":2020,"publication_date":"2020-08-06","ids":{"openalex":"https://openalex.org/W2986160164","doi":"https://doi.org/10.1007/s11075-020-00987-6","mag":"2986160164"},"language":"en","primary_location":{"id":"doi:10.1007/s11075-020-00987-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-020-00987-6","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.06072","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Geovani N. Grapiglia","orcid":"https://orcid.org/0000-0003-3284-3371"},"institutions":[{"id":"https://openalex.org/I52418104","display_name":"Universidade Federal do Paran\u00e1","ror":"https://ror.org/05syd6y78","country_code":"BR","type":"education","lineage":["https://openalex.org/I52418104"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Geovani N. Grapiglia","raw_affiliation_strings":["Departamento de Matem\u00e1tica, Universidade Federal do Paran\u00e1, Centro Polit\u00e9cnico, Cx. Postal 19.081, Curitiba, Paran\u00e1, 81531-980, Brazil"],"raw_orcid":"https://orcid.org/0000-0003-3284-3371","affiliations":[{"raw_affiliation_string":"Departamento de Matem\u00e1tica, Universidade Federal do Paran\u00e1, Centro Polit\u00e9cnico, Cx. Postal 19.081, Curitiba, Paran\u00e1, 81531-980, Brazil","institution_ids":["https://openalex.org/I52418104"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ekkehard W. Sachs","orcid":null},"institutions":[{"id":"https://openalex.org/I89864525","display_name":"Universit\u00e4t Trier","ror":"https://ror.org/02778hg05","country_code":"DE","type":"education","lineage":["https://openalex.org/I89864525"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Ekkehard W. Sachs","raw_affiliation_strings":["Department of Mathematics, University of Trier, Trier, 54286, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Trier, Trier, 54286, Germany","institution_ids":["https://openalex.org/I89864525"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I52418104"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.1544,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.48322272,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"87","issue":"2","first_page":"779","last_page":"796"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.27489998936653137,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.27489998936653137,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.14309999346733093,"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"}},{"id":"https://openalex.org/T13664","display_name":"Genome Rearrangement Algorithms","score":0.050599999725818634,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.7829999923706055},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.6991999745368958},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.6764000058174133},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.582099974155426},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.5507000088691711},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.31200000643730164}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7829999923706055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7307000160217285},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6991999745368958},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.6764000058174133},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.582099974155426},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.5507000088691711},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46799999475479126},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3617999851703644},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3490000069141388},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3409999907016754},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31200000643730164},{"id":"https://openalex.org/C48753275","wikidata":"https://www.wikidata.org/wiki/Q11216","display_name":"Numerical analysis","level":2,"score":0.30390000343322754},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2953999936580658},{"id":"https://openalex.org/C2983064736","wikidata":"https://www.wikidata.org/wiki/Q20779668","display_name":"Algorithmic complexity","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2624000012874603},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s11075-020-00987-6","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s11075-020-00987-6","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"},{"id":"pmh:oai:arXiv.org:1911.06072","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.06072","pdf_url":"https://arxiv.org/pdf/1911.06072","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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"},{"id":"pmh:oai:dial.uclouvain.be:boreal:272749","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/272749","pdf_url":null,"source":{"id":"https://openalex.org/S4306400166","display_name":"Digital Access to Libraries","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2800384882","host_organization_name":"Harris County Public Library","host_organization_lineage":["https://openalex.org/I2800384882"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Numerical Algorithms, Vol. 87, p. 779-796 (2021)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.06072","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.06072","pdf_url":"https://arxiv.org/pdf/1911.06072","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3774921934","display_name":null,"funder_award_id":"406269/2016-5","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G5433969572","display_name":null,"funder_award_id":"401288/2014-5","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W148948641","https://openalex.org/W1992654678","https://openalex.org/W1994974865","https://openalex.org/W1999842813","https://openalex.org/W2009941369","https://openalex.org/W2023523104","https://openalex.org/W2024060531","https://openalex.org/W2035226238","https://openalex.org/W2043409612","https://openalex.org/W2043430160","https://openalex.org/W2043672507","https://openalex.org/W2044207982","https://openalex.org/W2056603712","https://openalex.org/W2056760934","https://openalex.org/W2077008103","https://openalex.org/W2086698159","https://openalex.org/W2098964861","https://openalex.org/W2107915509","https://openalex.org/W2124541940","https://openalex.org/W2149454052","https://openalex.org/W2167137033","https://openalex.org/W2203904367","https://openalex.org/W2398500126","https://openalex.org/W2509591300","https://openalex.org/W2510806995","https://openalex.org/W2530585400","https://openalex.org/W2599851351","https://openalex.org/W2613814804","https://openalex.org/W2619018971","https://openalex.org/W2623997598","https://openalex.org/W2739128850","https://openalex.org/W2807533981","https://openalex.org/W2901838001","https://openalex.org/W2963075511","https://openalex.org/W2963307318","https://openalex.org/W3003832934","https://openalex.org/W3023674141"],"related_works":[],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-03T08:13:44.112507","created_date":"2019-11-22T00:00:00"}