{"id":"https://openalex.org/W7154716148","doi":"https://doi.org/10.1007/s10589-026-00778-0","title":"A speed up strategy for gradient methods","display_name":"A speed up strategy for gradient methods","publication_year":2026,"publication_date":"2026-04-17","ids":{"openalex":"https://openalex.org/W7154716148","doi":"https://doi.org/10.1007/s10589-026-00778-0"},"language":"en","primary_location":{"id":"doi:10.1007/s10589-026-00778-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-026-00778-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-026-00778-0.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10589-026-00778-0.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072353341","display_name":"Anna De Magistris","orcid":"https://orcid.org/0009-0004-1633-2365"},"institutions":[{"id":"https://openalex.org/I4210126337","display_name":"University of Campania \"Luigi Vanvitelli\"","ror":null,"country_code":"IT","type":null,"lineage":["https://openalex.org/I4210126337"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Anna De Magistris","raw_affiliation_strings":["Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy"],"raw_orcid":"https://orcid.org/0009-0004-1633-2365","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy","institution_ids":["https://openalex.org/I4210126337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070058552","display_name":"Serena Crisci","orcid":"https://orcid.org/0000-0001-9130-8163"},"institutions":[{"id":"https://openalex.org/I4210126337","display_name":"University of Campania \"Luigi Vanvitelli\"","ror":null,"country_code":"IT","type":null,"lineage":["https://openalex.org/I4210126337"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Serena Crisci","raw_affiliation_strings":["Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy","institution_ids":["https://openalex.org/I4210126337"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060944643","display_name":"Valentina De Simone","orcid":"https://orcid.org/0000-0002-3357-5252"},"institutions":[{"id":"https://openalex.org/I4210126337","display_name":"University of Campania \"Luigi Vanvitelli\"","ror":null,"country_code":"IT","type":null,"lineage":["https://openalex.org/I4210126337"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Valentina De Simone","raw_affiliation_strings":["Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy","institution_ids":["https://openalex.org/I4210126337"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077915202","display_name":"Gerardo Toraldo","orcid":"https://orcid.org/0000-0001-9703-5557"},"institutions":[{"id":"https://openalex.org/I4210126337","display_name":"University of Campania \"Luigi Vanvitelli\"","ror":null,"country_code":"IT","type":null,"lineage":["https://openalex.org/I4210126337"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Gerardo Toraldo","raw_affiliation_strings":["Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Physics, University of Campania \u201cLuigi Vanvitelli\u201d, Viale Lincoln 5, 81100, Caserta, CE, Italy","institution_ids":["https://openalex.org/I4210126337"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5072353341"],"corresponding_institution_ids":["https://openalex.org/I4210126337"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.60840552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"94","issue":"2","first_page":"509","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9319999814033508,"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"}},"topics":[{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9319999814033508,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.05119999870657921,"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.0020000000949949026,"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/acceleration","display_name":"Acceleration","score":0.79830002784729},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.7174000144004822},{"id":"https://openalex.org/keywords/initialization","display_name":"Initialization","score":0.6456999778747559},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.578499972820282},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5432000160217285},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.5336999893188477},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.5238999724388123},{"id":"https://openalex.org/keywords/affine-transformation","display_name":"Affine transformation","score":0.516700029373169},{"id":"https://openalex.org/keywords/extension","display_name":"Extension (predicate logic)","score":0.5038999915122986}],"concepts":[{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.79830002784729},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.7174000144004822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6520000100135803},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.6456999778747559},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.578499972820282},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5586000084877014},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5432000160217285},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.5336999893188477},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.5238999724388123},{"id":"https://openalex.org/C92757383","wikidata":"https://www.wikidata.org/wiki/Q382497","display_name":"Affine transformation","level":2,"score":0.516700029373169},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.47029998898506165},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4332999885082245},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4235000014305115},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4065000116825104},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3944999873638153},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.3671000003814697},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.35350000858306885},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.3506999909877777},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2939999997615814},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2874000072479248},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.2867000102996826},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2851000130176544},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.2768999934196472},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C2778459887","wikidata":"https://www.wikidata.org/wiki/Q6787865","display_name":"Matrix completion","level":3,"score":0.2646999955177307},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2565000057220459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10589-026-00778-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-026-00778-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-026-00778-0.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10589-026-00778-0","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10589-026-00778-0","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10589-026-00778-0.pdf","source":{"id":"https://openalex.org/S39243548","display_name":"Computational Optimization and Applications","issn_l":"0926-6003","issn":["0926-6003","1573-2894"],"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":"Computational Optimization and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320325777","display_name":"Universit\u00e0 degli Studi della Campania Luigi Vanvitelli","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7154716148.pdf","grobid_xml":"https://content.openalex.org/works/W7154716148.grobid-xml"},"referenced_works_count":45,"referenced_works":["https://openalex.org/W94444364","https://openalex.org/W1489912229","https://openalex.org/W1497361805","https://openalex.org/W1530695493","https://openalex.org/W1534394688","https://openalex.org/W1546266651","https://openalex.org/W1547688086","https://openalex.org/W1579664581","https://openalex.org/W1973734200","https://openalex.org/W1988720110","https://openalex.org/W1988849934","https://openalex.org/W1998252084","https://openalex.org/W2000218110","https://openalex.org/W2004461831","https://openalex.org/W2004580901","https://openalex.org/W2015131139","https://openalex.org/W2021484063","https://openalex.org/W2026289804","https://openalex.org/W2026951624","https://openalex.org/W2031127394","https://openalex.org/W2041187281","https://openalex.org/W2043430160","https://openalex.org/W2045010238","https://openalex.org/W2055018991","https://openalex.org/W2066692739","https://openalex.org/W2076605490","https://openalex.org/W2093575660","https://openalex.org/W2098132613","https://openalex.org/W2116147316","https://openalex.org/W2118075667","https://openalex.org/W2126607811","https://openalex.org/W2138616240","https://openalex.org/W2149454052","https://openalex.org/W2167137033","https://openalex.org/W2204799877","https://openalex.org/W2329996474","https://openalex.org/W2610492509","https://openalex.org/W2766258225","https://openalex.org/W3023463767","https://openalex.org/W3216375106","https://openalex.org/W4283259651","https://openalex.org/W4320912789","https://openalex.org/W4377292218","https://openalex.org/W4391228326","https://openalex.org/W4399224204"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1,41,155],"this":[2,156,164],"paper,":[3],"we":[4,158],"propose":[5],"a":[6,160,171],"new":[7],"acceleration":[8,64,75,119],"strategy":[9,22],"for":[10,170],"gradient-based":[11],"methods":[12,124],"applied":[13],"to":[14,70,96,130,148,178],"strictly":[15],"convex":[16],"Quadratic":[17],"Programming":[18],"(QP)":[19],"problems.":[20],"The":[21],"consists":[23],"in":[24,59,63,121,142,163],"performing,":[25],"at":[26],"selected":[27],"iterations,":[28],"minimization":[29,132,153,180],"steps":[30,76,120],"along":[31],"alternative":[32],"descent":[33],"directions":[34],"or":[35],"even":[36],"within":[37],"low-dimensional":[38],"affine":[39],"subspaces.":[40],"particular,":[42,143],"considering":[43],"the":[44,47,53,72,78,98,116,134,151,175,179],"contribution":[45],"of":[46,52,74,80,118,136,174,181],"linear":[48],"and":[49,89,109],"quadratic":[50],"part":[51],"objective":[54],"function":[55],"could":[56],"be":[57],"useful":[58],"designing":[60],"line":[61],"searches":[62],"steps.":[65],"We":[66,84],"present":[67],"numerical":[68],"experiments":[69,113],"assess":[71,97],"impact":[73],"on":[77],"performance":[79],"different":[81],"gradient":[82],"methods.":[83],"examined":[85],"randomly":[86],"generated":[87],"QP":[88,92],"box":[90],"constrained":[91],"test":[93],"problems,":[94,133],"designed":[95],"algorithms":[99],"under":[100],"various":[101],"conditions,":[102],"such":[103],"as":[104],"matrix":[105],"dimensions,":[106],"condition":[107],"numbers,":[108],"initialization":[110],"strategies.":[111],"Our":[112],"show":[114],"that":[115],"use":[117],"some":[122],"Barzilai\u2013Borwein":[123],"significantly":[125],"improves":[126],"computational":[127],"results.":[128],"Moving":[129],"general":[131,182],"extension":[135,173],"our":[137],"approach":[138],"is":[139,145],"not":[140,146],"straightforward;":[141],"it":[144],"possible":[147,172],"directly":[149],"extend":[150],"two-dimensional":[152],"phase.":[154],"work,":[157],"take":[159],"first":[161],"step":[162],"direction":[165],"by":[166],"providing":[167],"preliminary":[168],"ideas":[169],"accelerated":[176],"algorithm":[177],"functions.":[183]},"counts_by_year":[],"updated_date":"2026-06-02T06:17:35.589633","created_date":"2026-04-18T00:00:00"}