{"id":"https://openalex.org/W2793381907","doi":"https://doi.org/10.1109/tac.2018.2805727","title":"On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization","display_name":"On the Convergence of Inexact Projection Primal First-Order Methods for Convex Minimization","publication_year":2018,"publication_date":"2018-02-13","ids":{"openalex":"https://openalex.org/W2793381907","doi":"https://doi.org/10.1109/tac.2018.2805727","mag":"2793381907"},"language":"en","primary_location":{"id":"doi:10.1109/tac.2018.2805727","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2018.2805727","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049988389","display_name":"Andrei P\u0103tra\u015fcu","orcid":"https://orcid.org/0000-0002-9293-9386"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Andrei Patrascu","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania"],"raw_orcid":"https://orcid.org/0000-0002-9293-9386","affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019114471","display_name":"Ion Necoara","orcid":"https://orcid.org/0000-0003-1102-2654"},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ion Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania"],"raw_orcid":"https://orcid.org/0000-0003-1102-2654","affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049988389"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":1.6646,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.8130113,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"63","issue":"10","first_page":"3317","last_page":"3329"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998999834060669,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9991999864578247,"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.9975000023841858,"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/mathematics","display_name":"Mathematics","score":0.6439375877380371},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.6113885641098022},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5832225680351257},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5543432235717773},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5331014394760132},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5188204646110535},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4797824025154114},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.47171705961227417},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.46640411019325256},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.45949769020080566},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42526721954345703},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3323131799697876},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3110368251800537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2524977922439575},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.0782800018787384}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6439375877380371},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.6113885641098022},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5832225680351257},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5543432235717773},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5331014394760132},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5188204646110535},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4797824025154114},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.47171705961227417},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.46640411019325256},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.45949769020080566},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42526721954345703},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3323131799697876},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3110368251800537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2524977922439575},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0782800018787384},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2018.2805727","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2018.2805727","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W835513632","https://openalex.org/W1519818083","https://openalex.org/W1578525449","https://openalex.org/W1963529497","https://openalex.org/W1981832695","https://openalex.org/W2000218110","https://openalex.org/W2003085133","https://openalex.org/W2013439434","https://openalex.org/W2026079951","https://openalex.org/W2033121805","https://openalex.org/W2037603831","https://openalex.org/W2044774602","https://openalex.org/W2047043241","https://openalex.org/W2063627433","https://openalex.org/W2070576018","https://openalex.org/W2088758164","https://openalex.org/W2093417350","https://openalex.org/W2106821132","https://openalex.org/W2121210949","https://openalex.org/W2124541940","https://openalex.org/W2124768887","https://openalex.org/W2168914046","https://openalex.org/W2173413132","https://openalex.org/W2208458196","https://openalex.org/W2234873940","https://openalex.org/W2288556437","https://openalex.org/W2510870520","https://openalex.org/W2963183767","https://openalex.org/W3099831354","https://openalex.org/W3141595720","https://openalex.org/W4301014485","https://openalex.org/W6634494469","https://openalex.org/W6685044387"],"related_works":["https://openalex.org/W2945629716","https://openalex.org/W4283775266","https://openalex.org/W4298860769","https://openalex.org/W3043533097","https://openalex.org/W2767126220","https://openalex.org/W3007770227","https://openalex.org/W2149119057","https://openalex.org/W4292651679","https://openalex.org/W2400034325","https://openalex.org/W2499557797"],"abstract_inverted_index":{"It":[0],"is":[1,30,77,180,211],"well-known":[2],"that":[3,184,207],"primal":[4,27,101,106,127,171],"first-order":[5,52,128,196],"algorithms":[6,197],"achieve":[7,188],"sublinear":[8,95],"(linear)":[9],"convergence":[10,68,86,96,125,190,215],"for":[11,133,192,244],"smooth":[12,109,139],"convex":[13,43,112,136,143,246],"(smooth":[14],"strongly":[15,111,142],"convex)":[16],"constrained":[17,135],"minimization.":[18],"However,":[19],"these":[20,89,117,193],"methods":[21,55,129],"encounter":[22],"numerical":[23],"difficulties":[24,66],"when":[25,69,104],"the":[26,50,70,73,85,105,124,150,169,202,208,222,225,229],"feasible":[28,47,172],"set":[29,48],"complicated,":[31],"since":[32,79],"they":[33,64,92],"require":[34],"exact":[35,166,203],"projection":[36,167,195,204,210,227],"onto":[37,168],"this":[38,80,120],"set.":[39],"Algorithmic":[40],"alternatives":[41],"to":[42,58,219,235,239],"problems":[44,137,254],"with":[45,130,138,198],"complicated":[46,61,170],"are":[49,56],"dual":[51],"methods.":[53,90],"Dual":[54],"able":[57],"handle":[59],"easily":[60],"constraints,":[62],"but":[63],"have":[65,93],"in":[67,84,98,119,201,237],"norm":[71,81],"of":[72,88,126,153,163,224,231],"optimal":[74],"Lagrange":[75],"multiplier":[76],"large,":[78],"appears":[82],"linearly":[83],"estimates":[87],"Moreover,":[91],"typically":[94],"rate":[97],"an":[99,165,174,241],"average":[100],"sequence,":[102],"even":[103],"problem":[107],"has":[108],"and":[110,140,156,228],"objective":[113,144],"function.":[114,145],"Motivated":[115],"by":[116],"issues,":[118],"paper,":[121],"we":[122,148,185,233],"analyze":[123],"inexact":[131,151,194,226],"projections":[132],"solving":[134],"then":[141],"In":[146],"particular,":[147],"consider":[149],"variants":[152],"Projected":[154,157],"Gradient":[155,159],"Fast":[158],"methods,":[160],"where":[161],"instead":[162],"computing":[164],"set,":[173],"approximate":[175,209,242],"projection,":[176],"not":[177],"necessarily":[178],"feasible,":[179],"used.":[181],"We":[182],"prove":[183],"can":[186],"still":[187],"similar":[189],"rates":[191],"those":[199],"given":[200],"settings,":[205],"provided":[206],"sufficiently":[212],"accurate.":[213],"Our":[214],"analysis":[216],"allows":[217],"us":[218],"derive":[220],"explicitly":[221],"accuracy":[223],"number":[230],"iterations":[232],"need":[234],"perform":[236],"order":[238],"obtain":[240],"solution":[243],"our":[245],"problem.":[247],"Finally,":[248],"practical":[249],"performance":[250],"on":[251],"random":[252],"quadratic":[253],"show":[255],"encouraging":[256],"results.":[257]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}