{"id":"https://openalex.org/W4414586901","doi":"https://doi.org/10.1007/s10957-026-03035-w","title":"Efficient Globalization of Heavy-Ball Type Methods for Unconstrained Optimization Based on Curve Searches","display_name":"Efficient Globalization of Heavy-Ball Type Methods for Unconstrained Optimization Based on Curve Searches","publication_year":2026,"publication_date":"2026-06-16","ids":{"openalex":"https://openalex.org/W4414586901","doi":"https://doi.org/10.1007/s10957-026-03035-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-026-03035-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-026-03035-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03035-w.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"type":"book-chapter","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03035-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5119756493","display_name":"Federica Donnini","orcid":null},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Federica Donnini","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Via di Santa Marta 3, 50139, Firenze, Italy"],"raw_orcid":"https://orcid.org/0009-0004-0377-2046","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Via di Santa Marta 3, 50139, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037874811","display_name":"Matteo Lapucci","orcid":"https://orcid.org/0000-0002-2488-5486"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Lapucci","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Via di Santa Marta 3, 50139, Firenze, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Via di Santa Marta 3, 50139, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007815499","display_name":"Pierluigi Mansueto","orcid":"https://orcid.org/0000-0002-1394-0937"},"institutions":[{"id":"https://openalex.org/I45084792","display_name":"University of Florence","ror":"https://ror.org/04jr1s763","country_code":"IT","type":"education","lineage":["https://openalex.org/I45084792"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Pierluigi Mansueto","raw_affiliation_strings":["Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Via di Santa Marta 3, 50139, Firenze, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Via di Santa Marta 3, 50139, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5119756493"],"corresponding_institution_ids":["https://openalex.org/I45084792"],"apc_list":{"value":3190,"currency":"USD","value_usd":3190},"apc_paid":{"value":3190,"currency":"USD","value_usd":3190},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01229508,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"210","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987999796867371,"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.9987999796867371,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9890999794006348,"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/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.9815000295639038,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.7409999966621399},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.48030000925064087},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4311999976634979},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.41179999709129333},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.3953999876976013},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.38449999690055847},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3732999861240387},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.3580999970436096}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7409999966621399},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6682000160217285},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4991999864578247},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.48030000925064087},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4311999976634979},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.41179999709129333},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.3953999876976013},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.38449999690055847},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3732999861240387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3675000071525574},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.3580999970436096},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3476000130176544},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3303000032901764},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3156999945640564},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2948000133037567},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2906999886035919},{"id":"https://openalex.org/C2119116","wikidata":"https://www.wikidata.org/wiki/Q7181","display_name":"Globalization","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2655999958515167},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C184389593","wikidata":"https://www.wikidata.org/wiki/Q603159","display_name":"Curve fitting","level":2,"score":0.25699999928474426}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10957-026-03035-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-026-03035-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03035-w.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2505.19705","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2505.19705","pdf_url":"https://arxiv.org/pdf/2505.19705","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:flore.unifi.it:2158/1476652","is_oa":true,"landing_page_url":"https://hdl.handle.net/2158/1476652","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"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":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.2505.19705","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2505.19705","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.1007/s10957-026-03035-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-026-03035-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03035-w.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322648","display_name":"Universit\u00e0 degli Studi di Firenze","ror":"https://ror.org/04jr1s763"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414586901.pdf","grobid_xml":"https://content.openalex.org/works/W4414586901.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2,115],"work,":[3],"we":[4,12,49,141],"deal":[5],"with":[6,93],"unconstrained":[7],"nonlinear":[8],"optimization":[9],"problems.":[10],"Specifically,":[11],"are":[13,46],"interested":[14],"in":[15,114,137,156],"methods":[16],"carrying":[17],"out":[18],"updates":[19],"possibly":[20],"along":[21,56],"directions":[22],"not":[23,47,82],"of":[24,31,40,106,111],"descent,":[25],"like":[26],"Polyak\u2019s":[27],"heavy-ball":[28,154],"algorithm.":[29],"Instead":[30],"enforcing":[32],"convergence":[33,90],"properties":[34],"through":[35],"line":[36],"searches":[37,55],"and":[38],"modifications":[39],"search":[41,61],"direction":[42,75],"when":[43],"suitable":[44],"safeguards":[45],"satisfied,":[48],"propose":[50],"a":[51,59,73,77,94],"strategy":[52,147],"based":[53],"on":[54],"curve":[57,60],"paths:":[58],"starting":[62],"from":[63],"the":[64,99,109,120,144,157,173,182],"first":[65],"tentative":[66],"update":[67],"allows":[68,148],"to":[69,126,149],"smoothly":[70],"revert":[71],"towards":[72],"gradient-related":[74],"if":[76],"sufficient":[78],"decrease":[79,96],"condition":[80],"is":[81,102,108],"met.":[83],"The":[84],"resulting":[85,121],"algorithm":[86,122],"provably":[87],"possesses":[88],"global":[89],"guarantees,":[91],"even":[92,171],"nonmonotone":[95],"condition.":[97],"While":[98],"presented":[100],"framework":[101,184],"rather":[103],"general,":[104],"particularly":[105],"interest":[107],"case":[110,130],"parabolic":[112],"searches;":[113],"case,":[116,160],"under":[117],"reasonable":[118],"assumptions,":[119],"can":[123],"be":[124,186],"shown":[125],"possess":[127],"optimal":[128],"worst":[129],"complexity":[131],"bounds":[132],"for":[133],"reaching":[134],"approximate":[135],"stationarity":[136],"nonconvex":[138],"settings.":[139],"Practically,":[140],"show":[142],"that":[143,181],"proposed":[145,183],"globalization":[146,163],"consistently":[150],"accept":[151],"(optimal)":[152],"pure":[153],"steps":[155],"strongly":[158],"convex":[159],"while":[161],"standard":[162],"approaches":[164],"would":[165],"at":[166],"times":[167],"reject":[168],"them":[169],"before":[170],"evaluating":[172],"objective":[174],"function.":[175],"Preliminary":[176],"computational":[177],"experiments":[178],"also":[179],"suggest":[180],"might":[185],"more":[187],"convenient":[188],"than":[189],"classical":[190],"safeguard-based":[191],"approaches.":[192]},"counts_by_year":[],"updated_date":"2026-09-02T18:50:13.731487","created_date":"2025-09-29T00:00:00"}