{"id":"https://openalex.org/W3119884131","doi":"https://doi.org/10.1109/cdc42340.2020.9303832","title":"Convergence Rate of a Penalty Method for Strongly Convex Problems with Linear Constraints","display_name":"Convergence Rate of a Penalty Method for Strongly Convex Problems with Linear Constraints","publication_year":2020,"publication_date":"2020-12-14","ids":{"openalex":"https://openalex.org/W3119884131","doi":"https://doi.org/10.1109/cdc42340.2020.9303832","mag":"3119884131"},"language":"en","primary_location":{"id":"doi:10.1109/cdc42340.2020.9303832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-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/A5110629459","display_name":"Angelia Nedi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Angelia Nedic","raw_affiliation_strings":["School of Electrical, Computer and Energy Engineering, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical, Computer and Energy Engineering, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042936048","display_name":"Tatiana Tatarenko","orcid":"https://orcid.org/0000-0001-8951-112X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Tatiana Tatarenko","raw_affiliation_strings":["Technical University Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Technical University Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110629459"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.8803,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.70658994,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"372","last_page":"377"},"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.9997000098228455,"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.9997000098228455,"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.9991000294685364,"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.9955000281333923,"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/penalty-method","display_name":"Penalty method","score":0.8499113321304321},{"id":"https://openalex.org/keywords/smoothness","display_name":"Smoothness","score":0.7387855648994446},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6663752794265747},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6544212102890015},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6422789096832275},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5141423344612122},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5098875761032104},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4625851809978485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4578619599342346},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.4315023124217987},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.42663371562957764},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.375522643327713},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3712722063064575},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.06370386481285095}],"concepts":[{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.8499113321304321},{"id":"https://openalex.org/C102634674","wikidata":"https://www.wikidata.org/wiki/Q868473","display_name":"Smoothness","level":2,"score":0.7387855648994446},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6663752794265747},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6544212102890015},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6422789096832275},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5141423344612122},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5098875761032104},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4625851809978485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4578619599342346},{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.4315023124217987},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.42663371562957764},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.375522643327713},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3712722063064575},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.06370386481285095},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc42340.2020.9303832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc42340.2020.9303832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 59th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:tubiblio.ulb.tu-darmstadt.de:153151","is_oa":false,"landing_page_url":"http://tubiblio.ulb.tu-darmstadt.de/view/person/Nedi==0107=3AAngelia=3A=3A.html>","pdf_url":null,"source":{"id":"https://openalex.org/S4377196390","display_name":"TUbilio (Technical University of Darmstadt)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I31512782","host_organization_name":"Technische Universit\u00e4t Darmstadt","host_organization_lineage":["https://openalex.org/I31512782"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"NonPeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6399999856948853,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1965013875","https://openalex.org/W1970997001","https://openalex.org/W1972711404","https://openalex.org/W2005022214","https://openalex.org/W2007149918","https://openalex.org/W2011652254","https://openalex.org/W2012180727","https://openalex.org/W2018503235","https://openalex.org/W2030918292","https://openalex.org/W2039696315","https://openalex.org/W2039957107","https://openalex.org/W2049659086","https://openalex.org/W2061863621","https://openalex.org/W2070986426","https://openalex.org/W2073750241","https://openalex.org/W2081728524","https://openalex.org/W2113239207","https://openalex.org/W2113372738","https://openalex.org/W2134130436","https://openalex.org/W2145858247","https://openalex.org/W2151267441","https://openalex.org/W2166524953","https://openalex.org/W2766745759","https://openalex.org/W3119884131","https://openalex.org/W4229753684","https://openalex.org/W4289673891","https://openalex.org/W4300446448","https://openalex.org/W6671308325"],"related_works":["https://openalex.org/W4313189992","https://openalex.org/W1788398095","https://openalex.org/W2615021531","https://openalex.org/W2076134677","https://openalex.org/W1989415423","https://openalex.org/W1948655259","https://openalex.org/W59247221","https://openalex.org/W2478018497","https://openalex.org/W2061155636","https://openalex.org/W2063330824"],"abstract_inverted_index":{"We":[0],"consider":[1],"an":[2],"optimization":[3],"problem":[4],"with":[5,18,65,75,105],"strongly":[6],"convex":[7],"objective":[8],"and":[9],"linear":[10],"inequalities":[11],"constraints.":[12],"To":[13,79],"be":[14],"able":[15],"to":[16,52,71],"deal":[17],"a":[19,26,37,59],"large":[20],"number":[21],"of":[22,29,39,47,82],"constraints":[23],"we":[24,35,85],"provide":[25],"penalty":[27,33,55,102],"reformulation":[28],"the":[30,40,62,66,72,76,80,87,91,95,101],"problem.":[31],"As":[32],"functions":[34,49],"use":[36],"version":[38],"one-sided":[41],"Huber":[42],"losses.":[43],"The":[44],"smoothness":[45],"properties":[46],"these":[48],"allow":[50],"us":[51],"choose":[53],"time-varying":[54],"parameters":[56,103],"in":[57,99],"such":[58],"way":[60],"that":[61],"incremental":[63],"procedure":[64],"diminishing":[67],"step-size":[68],"converges":[69],"\u221a":[70],"exact":[73],"solution":[74],"rate":[77,93],"O(1/\u221ak).":[78],"best":[81],"our":[83],"knowledge,":[84],"present":[86],"first":[88],"result":[89],"on":[90],"convergence":[92],"for":[94],"penalty-based":[96],"gradient":[97],"method,":[98],"which":[100],"vary":[104],"time.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2026-02-26T08:16:20.718346","created_date":"2025-10-10T00:00:00"}