{"id":"https://openalex.org/W2605995072","doi":"https://doi.org/10.1080/10556788.2017.1380642","title":"Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming","display_name":"Complexity of first-order inexact Lagrangian and penalty methods for conic convex programming","publication_year":2017,"publication_date":"2017-10-05","ids":{"openalex":"https://openalex.org/W2605995072","doi":"https://doi.org/10.1080/10556788.2017.1380642","mag":"2605995072"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2017.1380642","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1380642","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":true,"oa_status":"green","oa_url":"http://hdl.handle.net/2078.1/195726","any_repository_has_fulltext":true},"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"],"affiliations":[{"raw_affiliation_string":"Automatic Control and Systems Engineering Department, University Politehnica Bucharest, 060042 Bucharest, Romania","institution_ids":["https://openalex.org/I61641377"]}]},{"author_position":"middle","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"],"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/A5038754080","display_name":"Fran\u00e7ois Glineur","orcid":"https://orcid.org/0000-0002-5890-1093"},"institutions":[{"id":"https://openalex.org/I95674353","display_name":"UCLouvain","ror":"https://ror.org/02495e989","country_code":"BE","type":"education","lineage":["https://openalex.org/I95674353"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"F. Glineur","raw_affiliation_strings":["Center for Operations Research and Econometrics, Catholic University of Louvain, B-1348 Louvain-la-Neuve, Belgium"],"affiliations":[{"raw_affiliation_string":"Center for Operations Research and Econometrics, Catholic University of Louvain, B-1348 Louvain-la-Neuve, Belgium","institution_ids":["https://openalex.org/I95674353"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019114471"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":5.1783,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.96101899,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"34","issue":"2","first_page":"305","last_page":"335"},"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.9991000294685364,"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.9991000294685364,"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.9990000128746033,"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.9947999715805054,"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/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.7455422878265381},{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.6879162788391113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.663676381111145},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.6154478788375854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5959815382957458},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.577575147151947},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.451107382774353},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42482301592826843},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4135040044784546},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41184669733047485},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.24447518587112427},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2163846790790558}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.7455422878265381},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.6879162788391113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.663676381111145},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.6154478788375854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5959815382957458},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.577575147151947},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.451107382774353},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42482301592826843},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4135040044784546},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41184669733047485},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.24447518587112427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2163846790790558},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1080/10556788.2017.1380642","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2017.1380642","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"},{"id":"pmh:oai:dial.uclouvain.be:boreal:195726","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/195726","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"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":"Optimization Methods and Software, Vol. 34, no. 2, p. 305-335 (2019)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:dial.uclouvain.be:boreal:195726","is_oa":true,"landing_page_url":"http://hdl.handle.net/2078.1/195726","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"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":"Optimization Methods and Software, Vol. 34, no. 2, p. 305-335 (2019)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G1686233381","display_name":null,"funder_award_id":"MoCOBiDS no. 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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W269693995","https://openalex.org/W1502987098","https://openalex.org/W1938879986","https://openalex.org/W1963529497","https://openalex.org/W1964522818","https://openalex.org/W1966953121","https://openalex.org/W1972010412","https://openalex.org/W2030121914","https://openalex.org/W2030161963","https://openalex.org/W2033121805","https://openalex.org/W2042860556","https://openalex.org/W2044774602","https://openalex.org/W2081316950","https://openalex.org/W2083974525","https://openalex.org/W2086336156","https://openalex.org/W2089559088","https://openalex.org/W2100556411","https://openalex.org/W2106821132","https://openalex.org/W2124768887","https://openalex.org/W2129470876","https://openalex.org/W2144603975","https://openalex.org/W2167732364","https://openalex.org/W2172030407","https://openalex.org/W2234873940","https://openalex.org/W3121465269","https://openalex.org/W4249513058"],"related_works":["https://openalex.org/W2015060724","https://openalex.org/W2058578573","https://openalex.org/W2012871340","https://openalex.org/W3046535663","https://openalex.org/W4367041984","https://openalex.org/W4313189992","https://openalex.org/W3035320230","https://openalex.org/W3105202832","https://openalex.org/W2017965889","https://openalex.org/W2025674539"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3,68,104,115,151],"present":[4],"a":[5,78,162],"complete":[6],"iteration":[7],"complexity":[8,73,107,157],"analysis":[9],"of":[10,41,74,89,139,158],"inexact":[11,52,62,96],"first-order":[12,48],"Lagrangian":[13,56,66],"and":[14,45,54,129],"penalty":[15,137,149],"methods":[16,49],"for":[17,124,135,171],"solving":[18,136],"cone-constrained":[19,126],"convex":[20,92,127],"problems":[21],"that":[22,31,117],"have":[23,27],"or":[24,58],"may":[25],"not":[26,122],"optimal":[28,42,118],"Lagrange":[29,43,119],"multipliers":[30,44,120],"close":[32],"the":[33,39,90,95,111,125,131,140,143,172],"duality":[34],"gap.":[35],"We":[36],"first":[37],"assume":[38,116],"existence":[40],"study":[46],"primal\u2013dual":[47],"based":[50],"on":[51],"information":[53],"augmented":[55,65],"smoothing":[57],"Nesterov-type":[59,102],"smoothing.":[60],"For":[61,94,142],"(fast)":[63],"gradient":[64,98,133,145],"methods,":[67],"derive":[69,105,153],"an":[70,86,154,168],"overall":[71,155],"computational":[72,106,156],"O(1/\u03f5)":[75],"projections":[76,109,160],"onto":[77,110,161],"simple":[79,163],"primal":[80,164],"set":[81,165],"in":[82],"order":[83],"to":[84,166],"attain":[85,167],"\u03b5-optimal":[87,169],"solution":[88,170],"conic":[91],"problem.":[93,141,174],"fast":[97,132,144],"method":[99,134,146],"combined":[100,147],"with":[101,148],"smoothing,":[103],"O(1/\u03f53/2)":[108,159],"same":[112],"set.":[113],"Then,":[114],"might":[121],"exist":[123],"problem,":[128],"analyse":[130],"reformulations":[138],"framework,":[150],"also":[152],"original":[173]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}