{"id":"https://openalex.org/W2159434603","doi":"https://doi.org/10.1137/080718814","title":"Convergence Analysis of Deflected Conditional Approximate Subgradient Methods","display_name":"Convergence Analysis of Deflected Conditional Approximate Subgradient Methods","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2159434603","doi":"https://doi.org/10.1137/080718814","mag":"2159434603"},"language":"en","primary_location":{"id":"doi:10.1137/080718814","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080718814","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://epubs.siam.org/doi/10.1137/080718814","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082517262","display_name":"Giacomo d'Antonio","orcid":null},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Giacomo d'Antonio","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 5, 56127 Pisa, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Pisa, Largo B. Pontecorvo 5, 56127 Pisa, Italy","institution_ids":["https://openalex.org/I108290504"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061303343","display_name":"Antonio Frangioni","orcid":"https://orcid.org/0000-0002-5704-3170"},"institutions":[{"id":"https://openalex.org/I108290504","display_name":"University of Pisa","ror":"https://ror.org/03ad39j10","country_code":"IT","type":"education","lineage":["https://openalex.org/I108290504"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Antonio Frangioni","raw_affiliation_strings":["Dipartimento di Informatica, Universit\u00e0 di Pisa, Polo Universitario della Spezia, Via dei Colli 90, 19121 La Spezia, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Informatica, Universit\u00e0 di Pisa, Polo Universitario della Spezia, Via dei Colli 90, 19121 La Spezia, Italy","institution_ids":["https://openalex.org/I108290504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082517262"],"corresponding_institution_ids":["https://openalex.org/I108290504"],"apc_list":null,"apc_paid":null,"fwci":2.3905,"has_fulltext":false,"cited_by_count":51,"citation_normalized_percentile":{"value":0.88383838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"20","issue":"1","first_page":"357","last_page":"386"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983999729156494,"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.9983999729156494,"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/T11245","display_name":"Advanced Numerical Analysis Techniques","score":0.9983999729156494,"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"}},{"id":"https://openalex.org/T11206","display_name":"Model Reduction and Neural Networks","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/subgradient-method","display_name":"Subgradient method","score":0.9728007316589355},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6611150503158569},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6273059248924255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5948038697242737},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.5136813521385193},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37792152166366577},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35954466462135315}],"concepts":[{"id":"https://openalex.org/C158968445","wikidata":"https://www.wikidata.org/wiki/Q7631150","display_name":"Subgradient method","level":2,"score":0.9728007316589355},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6611150503158569},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6273059248924255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5948038697242737},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.5136813521385193},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37792152166366577},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35954466462135315},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/080718814","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080718814","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:eprints.adm.unipi.it:601","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306401711","display_name":"UnipiEprints Open Archive (Universit\u00e0 di Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.1341","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.1341","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.di.unipi.it/~frangio/papers/DeflProjSubG.pdf","raw_type":"text"},{"id":"pmh:oai:arpi.unipi.it:11568/129549","is_oa":true,"landing_page_url":"https://epubs.siam.org/doi/10.1137/080718814","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"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":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:arpi.unipi.it:11568/129549","is_oa":true,"landing_page_url":"https://epubs.siam.org/doi/10.1137/080718814","pdf_url":null,"source":{"id":"https://openalex.org/S4377196265","display_name":"CINECA IRIS Institutial research information system (University of Pisa)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I108290504","host_organization_name":"University of Pisa","host_organization_lineage":["https://openalex.org/I108290504"],"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":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.4300000071525574,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W224775207","https://openalex.org/W1544036702","https://openalex.org/W1551892507","https://openalex.org/W1568288633","https://openalex.org/W1583497301","https://openalex.org/W1970750627","https://openalex.org/W1971290991","https://openalex.org/W1989626574","https://openalex.org/W2003973127","https://openalex.org/W2008919321","https://openalex.org/W2011746047","https://openalex.org/W2020202653","https://openalex.org/W2041221438","https://openalex.org/W2041715582","https://openalex.org/W2050014122","https://openalex.org/W2050907032","https://openalex.org/W2054090890","https://openalex.org/W2059050877","https://openalex.org/W2083432309","https://openalex.org/W2086003967","https://openalex.org/W2089472568","https://openalex.org/W2090246427","https://openalex.org/W2091352139","https://openalex.org/W2119273405","https://openalex.org/W2127635925","https://openalex.org/W2169713291","https://openalex.org/W2172033258","https://openalex.org/W2172228337","https://openalex.org/W2172263749","https://openalex.org/W2181039776","https://openalex.org/W2757616806","https://openalex.org/W2913988959","https://openalex.org/W4233177862","https://openalex.org/W4256046638"],"related_works":["https://openalex.org/W2095293854","https://openalex.org/W2363143319","https://openalex.org/W2757616806","https://openalex.org/W1984909291","https://openalex.org/W2127198104","https://openalex.org/W2117722264","https://openalex.org/W1964718673","https://openalex.org/W2331887418","https://openalex.org/W2129541103","https://openalex.org/W2016138713"],"abstract_inverted_index":{"Subgradient":[0],"methods":[1],"for":[2,127,222],"nondifferentiable":[3],"optimization":[4,167],"benefit":[5,30],"from":[6,31,48],"deflection,":[7],"i.e.,":[8],"defining":[9],"the":[10,17,21,25,34,38,44,49,57,101,105,109,132,150,155,162,166,181,188,193,197,213,217,226],"search":[11,35],"direction":[12,19,36],"as":[13],"a":[14,81,120,137,141,178],"combination":[15],"of":[16,33,51,84,92,144,165,180,216,225,231,242],"previous":[18],"and":[20,77,90,172],"current":[22],"subgradient.":[23],"In":[24],"constrained":[26],"case":[27],"they":[28],"also":[29],"projection":[32],"onto":[37],"feasible":[39],"set":[40],"prior":[41],"to":[42,125,211,235,240,251],"computing":[43],"steplength,":[45],"that":[46],"is,":[47],"use":[50],"conditional":[52,94],"subgradient":[53,96,245],"techniques.":[54],"However,":[55],"combining":[56],"two":[58],"techniques":[59],"is":[60,68,134,149,158,200,233],"not":[61],"straightforward,":[62],"especially":[63],"if":[64],"an":[65],"inexact":[66,189],"oracle":[67,198],"available":[69,102,201],"which":[70,157,184],"can":[71,206],"only":[72],"compute":[73],"approximate":[74,93],"function":[75],"values":[76],"subgradients.":[78],"We":[79],"present":[80],"convergence":[82,214,258],"analysis":[83,99,220],"several":[85,203,223],"different":[86],"variants,":[87],"both":[88,170],"conceptual":[89],"implementable,":[91],"deflected":[95],"methods.":[97],"Our":[98],"extends":[100],"results":[103],"in":[104,119,187,202,209],"literature":[106],"by":[107,196],"using":[108,161],"main":[110],"stepsize":[111,133],"rules":[112,130],"presented":[113],"so":[114],"far,":[115],"while":[116,255],"allowing":[117],"deflection":[118,151],"more":[121],"flexible":[122],"way.":[123],"Furthermore,":[124],"allow":[126],"(diminishing/square":[128],"summable)":[129],"where":[131,147],"tightly":[135],"controlled":[136],"priori,":[138],"we":[139,176],"propose":[140,177],"new":[142],"class":[143],"deflection-restricted":[145],"approaches":[146,250],"it":[148],"parameter,":[152],"rather":[153],"than":[154],"stepsize,":[156],"dynamically":[159],"adjusted":[160],"\u201ctarget":[163],"value\u201d":[164],"sequence.":[168],"For":[169],"Polyak-type":[171],"diminishing/square":[173],"summable":[174],"stepsizes,":[175],"\u201ccorrection\u201d":[179],"standard":[182],"formula":[183],"shows":[185],"that,":[186],"case,":[190],"knowledge":[191],"about":[192],"error":[194],"computed":[195],"(which":[199],"practical":[204],"applications)":[205],"be":[207],"exploited":[208],"order":[210],"strengthen":[212],"properties":[215],"method.":[218],"The":[219],"allows":[221],"variants":[224],"algorithm;":[227],"at":[228],"least":[229],"one":[230],"them":[232],"likely":[234],"show":[236],"numerical":[237],"performances":[238],"similar":[239],"these":[241],"\u201cheavy":[243],"ball\u201d":[244],"methods,":[246],"popular":[247],"within":[248],"backpropagation":[249],"train":[252],"neural":[253],"networks,":[254],"possessing":[256],"stronger":[257],"properties.":[259]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-03-24T08:02:53.985720","created_date":"2025-10-10T00:00:00"}