{"id":"https://openalex.org/W7167268145","doi":"https://doi.org/10.1007/s10957-026-03054-7","title":"Projected Gradient Methods with Momentum","display_name":"Projected Gradient Methods with Momentum","publication_year":2026,"publication_date":"2026-07-01","ids":{"openalex":"https://openalex.org/W7167268145","doi":"https://doi.org/10.1007/s10957-026-03054-7"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-026-03054-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-026-03054-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03054-7.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":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03054-7.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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, Firenze, Italy"],"raw_orcid":"https://orcid.org/0000-0002-2488-5486","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria dell\u2019Informazione, Universit\u00e0 di Firenze, Firenze, Italy","institution_ids":["https://openalex.org/I45084792"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030824254","display_name":"Giampaolo Liuzzi","orcid":"https://orcid.org/0000-0002-4063-8370"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giampaolo Liuzzi","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy"],"raw_orcid":"https://orcid.org/0000-0002-4063-8370","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067509935","display_name":"Stefano Lucidi","orcid":"https://orcid.org/0000-0003-4356-7958"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Stefano Lucidi","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4356-7958","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081279718","display_name":"Marco Sciandrone","orcid":"https://orcid.org/0000-0002-5234-3174"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Sciandrone","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy"],"raw_orcid":"https://orcid.org/0000-0002-5234-3174","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5117333889","display_name":"Diego Scuppa","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Diego Scuppa","raw_affiliation_strings":["Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy"],"raw_orcid":"https://orcid.org/0009-0009-9720-8855","affiliations":[{"raw_affiliation_string":"Dipartimento di Ingegneria Informatica, Automatica e Gestionale, Sapienza Universit\u00e0 di Roma, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5117333889"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"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.68751786,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9620000123977661,"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.9620000123977661,"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.016200000420212746,"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.008899999782443047,"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/convergence","display_name":"Convergence (economics)","score":0.6355999708175659},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5861999988555908},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.5625},{"id":"https://openalex.org/keywords/momentum","display_name":"Momentum (technical analysis)","score":0.5622000098228455},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.513700008392334},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5110999941825867},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5077000260353088},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.492000013589859}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7074000239372253},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6355999708175659},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5861999988555908},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.5625},{"id":"https://openalex.org/C60718061","wikidata":"https://www.wikidata.org/wiki/Q1414747","display_name":"Momentum (technical analysis)","level":2,"score":0.5622000098228455},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.542900025844574},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.513700008392334},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5110999941825867},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5077000260353088},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.492000013589859},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4894999861717224},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4781000018119812},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.43709999322891235},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3646000027656555},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.35420000553131104},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.3321000039577484},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.3174000084400177},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3075999915599823},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.30169999599456787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29739999771118164},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.2632000148296356}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10957-026-03054-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-026-03054-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03054-7.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:2601.16683","is_oa":true,"landing_page_url":"https://arxiv.org/abs/2601.16683","pdf_url":"https://arxiv.org/pdf/2601.16683","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/1478432","is_oa":true,"landing_page_url":"https://hdl.handle.net/2158/1478432","pdf_url":"https://flore.unifi.it/bitstream/2158/1478432/1/Lapucci_et_al-2026-Journal_of_Optimization_Theory_and_Applications.pdf","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"}],"best_oa_location":{"id":"doi:10.1007/s10957-026-03054-7","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-026-03054-7","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-026-03054-7.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":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7167268145.pdf","grobid_xml":"https://content.openalex.org/works/W7167268145.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1489912229","https://openalex.org/W1546275378","https://openalex.org/W1966518481","https://openalex.org/W1973734200","https://openalex.org/W1978100686","https://openalex.org/W1988720110","https://openalex.org/W2000218110","https://openalex.org/W2012341322","https://openalex.org/W2013243898","https://openalex.org/W2015131139","https://openalex.org/W2016189650","https://openalex.org/W2043430160","https://openalex.org/W2057565823","https://openalex.org/W2076605490","https://openalex.org/W2117699623","https://openalex.org/W2149454052","https://openalex.org/W2180180824","https://openalex.org/W2620883262","https://openalex.org/W2787894218","https://openalex.org/W2963433607","https://openalex.org/W3110931384","https://openalex.org/W3130203750","https://openalex.org/W3161794388","https://openalex.org/W3216569558","https://openalex.org/W4220813952","https://openalex.org/W4220913814","https://openalex.org/W4293796005","https://openalex.org/W4378552348","https://openalex.org/W4399845383","https://openalex.org/W4416719856"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1],"focus":[2],"on":[3,27],"the":[4,19,68,90,103,112,119],"optimization":[5],"problem":[6],"with":[7,74],"smooth,":[8],"possibly":[9],"nonconvex":[10],"objectives":[11],"and":[12,36,78],"a":[13,33,71],"convex":[14],"constraint":[15],"set":[16],"for":[17,39],"which":[18],"Euclidean":[20],"projection":[21],"operation":[22],"is":[23,61,85,108,117],"practically":[24],"available.":[25],"Focusing":[26],"this":[28],"setting,":[29],"we":[30,43],"carry":[31],"out":[32],"general":[34],"convergence":[35],"complexity":[37],"analysis":[38],"algorithmic":[40],"frameworks.":[41],"Consequently,":[42],"discuss":[44],"theoretically":[45],"sound":[46],"strategies":[47],"to":[48,67,88],"integrate":[49],"momentum":[50,106],"information":[51],"within":[52],"classical":[53],"projected":[54,93],"gradient-type":[55],"algorithms.":[56],"One":[57],"of":[58,70,105],"these":[59],"approaches":[60],"then":[62],"developed":[63],"in":[64,96,111,118],"detail,":[65],"up":[66],"definition":[69],"tailored":[72],"algorithm":[73],"both":[75],"theoretical":[76],"guarantees":[77],"reasonable":[79],"per-iteration":[80],"cost.":[81],"The":[82],"proposed":[83],"method":[84,95],"finally":[86],"shown":[87],"outperform":[89],"standard":[91],"(spectral)":[92],"gradient":[94],"two":[97],"different":[98],"experimental":[99],"benchmarks,":[100],"indicating":[101],"that":[102],"addition":[104],"terms":[107],"as":[109,115],"beneficial":[110],"constrained":[113],"setting":[114],"it":[116],"unconstrained":[120],"scenario.":[121]},"counts_by_year":[],"updated_date":"2026-08-29T07:29:34.045763","created_date":"2026-07-04T00:00:00"}