{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:03:24Z","timestamp":1756461804302,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,12,14]]},"DOI":"10.1109\/cdc42340.2020.9303832","type":"proceedings-article","created":{"date-parts":[[2021,1,13]],"date-time":"2021-01-13T02:27:32Z","timestamp":1610504852000},"page":"372-377","source":"Crossref","is-referenced-by-count":2,"title":["Convergence Rate of a Penalty Method for Strongly Convex Problems with Linear Constraints"],"prefix":"10.1109","author":[{"given":"Angelia","family":"Nedic","sequence":"first","affiliation":[]},{"given":"Tatiana","family":"Tatarenko","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/72.883426"},{"key":"ref11","first-page":"1547","article-title":"Incremental subgradients for constrained convex optimization, a unified framework and new methods","volume":"20","author":"helou","year":"2009","journal-title":"SIAM Journal on Optimization"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/08073038X"},{"key":"ref13","first-page":"1311","article-title":"Decomposition into functions in the minimization problem","volume":"40","author":"kibardin","year":"1980","journal-title":"Automation and Remote Control"},{"journal-title":"Convex optimization over intersection of simple sets improved convergence rate guarantees via an exact penalty approach","year":"2017","author":"kundu","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495293160"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1991.3.2.226"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.58"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0468-9"},{"journal-title":"Convergence rate of a penalty method for strongly convex problems with linear constraints","year":"2020","author":"nedi?","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0472-0"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495287022"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728716"},{"journal-title":"Incremental gradient subgradient and proximal methods for convex optimization A survey","year":"2015","author":"bertsekas","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1050.0175"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2013.2258412"},{"key":"ref2","article-title":"Constrained Optimization and Lagrange Multiplier Methods (Optimization and Neural Computation Series)","author":"bertsekas","year":"1996","journal-title":"Athena Scientific"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/10556789408805583"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/31.75395"},{"key":"ref20","first-page":"141","article-title":"Constrained genetic optimization via dynamic reward-penalty balancing and its use in pattern recognition","author":"siedlecki","year":"1989","journal-title":"Proceedings of the Third International Conference on Genetic Algorithms"},{"journal-title":"A smooth inexact penalty reformulation of convex problems with linear constraints","year":"2018","author":"tatarenko","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018366000512"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0769-x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495294797"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.245"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2008.4518374"}],"event":{"name":"2020 59th IEEE Conference on Decision and Control (CDC)","start":{"date-parts":[[2020,12,14]]},"location":"Jeju, Korea (South)","end":{"date-parts":[[2020,12,18]]}},"container-title":["2020 59th IEEE Conference on Decision and Control (CDC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9303728\/9303729\/09303832.pdf?arnumber=9303832","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T11:53:34Z","timestamp":1656330814000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9303832\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,14]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/cdc42340.2020.9303832","relation":{},"subject":[],"published":{"date-parts":[[2020,12,14]]}}}