{"id":"https://openalex.org/W2234873940","doi":"https://doi.org/10.1080/10556788.2016.1161763","title":"Iteration complexity analysis of dual first-order methods for conic convex programming","display_name":"Iteration complexity analysis of dual first-order methods for conic convex programming","publication_year":2016,"publication_date":"2016-03-30","ids":{"openalex":"https://openalex.org/W2234873940","doi":"https://doi.org/10.1080/10556788.2016.1161763","mag":"2234873940"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2016.1161763","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1161763","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/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":true,"raw_author_name":"I. Necoara","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"last","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":false,"raw_author_name":"A. Patrascu","raw_affiliation_strings":["Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":4.0132,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.93012113,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"31","issue":"3","first_page":"645","last_page":"678"},"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.9991999864578247,"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.9991999864578247,"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/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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/conic-section","display_name":"Conic section","score":0.7017964720726013},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6325204968452454},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6208142042160034},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5597918629646301},{"id":"https://openalex.org/keywords/lipschitz-continuity","display_name":"Lipschitz continuity","score":0.5583319067955017},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5288188457489014},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.5223751664161682},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4671667814254761},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.454165518283844},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.44537806510925293},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.42089152336120605},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.35333603620529175},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3507705330848694},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.30514198541641235},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1256260871887207}],"concepts":[{"id":"https://openalex.org/C108598597","wikidata":"https://www.wikidata.org/wiki/Q124255","display_name":"Conic section","level":2,"score":0.7017964720726013},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6325204968452454},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6208142042160034},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5597918629646301},{"id":"https://openalex.org/C22324862","wikidata":"https://www.wikidata.org/wiki/Q652707","display_name":"Lipschitz continuity","level":2,"score":0.5583319067955017},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5288188457489014},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.5223751664161682},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4671667814254761},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.454165518283844},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.44537806510925293},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.42089152336120605},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.35333603620529175},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3507705330848694},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.30514198541641235},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1256260871887207},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2016.1161763","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2016.1161763","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3815946989","display_name":null,"funder_award_id":"MoCOBiDS, 176/01.10.2015","funder_id":"https://openalex.org/F4320323983","funder_display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii"}],"funders":[{"id":"https://openalex.org/F4320323983","display_name":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","ror":"https://ror.org/01q7jq182"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W929521247","https://openalex.org/W1963529497","https://openalex.org/W1989165177","https://openalex.org/W2003085133","https://openalex.org/W2012848493","https://openalex.org/W2030121914","https://openalex.org/W2030161963","https://openalex.org/W2032606187","https://openalex.org/W2033121805","https://openalex.org/W2044774602","https://openalex.org/W2053764342","https://openalex.org/W2088624648","https://openalex.org/W2094336028","https://openalex.org/W2101868363","https://openalex.org/W2106424475","https://openalex.org/W2106821132","https://openalex.org/W2114085163","https://openalex.org/W2117669906","https://openalex.org/W2124541940","https://openalex.org/W2127447444","https://openalex.org/W2149192560","https://openalex.org/W2153745131","https://openalex.org/W2159715570","https://openalex.org/W2167732364","https://openalex.org/W2169391377","https://openalex.org/W2951002577","https://openalex.org/W3141595720","https://openalex.org/W4249513058"],"related_works":["https://openalex.org/W4245261984","https://openalex.org/W2153096592","https://openalex.org/W3199026565","https://openalex.org/W4323321439","https://openalex.org/W3124564720","https://openalex.org/W2952330476","https://openalex.org/W2180827833","https://openalex.org/W4293777484","https://openalex.org/W2588229150","https://openalex.org/W2031269429"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,38,50,75],"provide":[4,76],"a":[5],"detailed":[6],"analysis":[7,64,95,120],"of":[8,12,88,101,104,113,126],"the":[9,28,40,45,57,82,89,98,102,105,114,117,130],"iteration":[10,118],"complexity":[11,119],"dual":[13,52,59,66,106],"first-order":[14,53,67],"methods":[15],"for":[16,55,65],"solving":[17,56],"conic":[18,34,46],"convex":[19,36],"problems.":[20],"When":[21],"it":[22],"is":[23,121],"difficult":[24],"to":[25,43],"project":[26],"on":[27,81,97,123],"primal":[29,83,92,128,132,137],"feasible":[30],"set":[31],"described":[32],"by":[33],"and":[35,48,71,85],"constraints,":[37],"use":[39],"Lagrangian":[41],"relaxation":[42],"handle":[44],"constraints":[47],"then,":[49],"apply":[51],"algorithms":[54,68],"corresponding":[58],"problem.":[60],"We":[61],"give":[62],"convergence":[63],"(dual":[69],"gradient":[70,73,103],"fast":[72],"algorithms):":[74],"sublinear":[77],"or":[78,108,134],"linear":[79],"estimates":[80],"suboptimality":[84],"feasibility":[86],"violation":[87],"generated":[90],"approximate":[91,127],"solutions.":[93],"Our":[94],"relies":[96],"Lipschitz":[99],"property":[100,112],"function":[107],"an":[109,135],"error":[110],"bound":[111],"dual.":[115],"Furthermore,":[116],"based":[122],"two":[124],"types":[125],"solutions:":[129],"last":[131],"iterate":[133],"average":[136],"sequence.":[138]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-14T06:09:40.864956","created_date":"2025-10-10T00:00:00"}