{"id":1053,"date":"2018-08-22T18:03:22","date_gmt":"2018-08-23T02:03:22","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=1053"},"modified":"2018-08-22T18:09:10","modified_gmt":"2018-08-23T02:09:10","slug":"online-distributed-convex-optimization-on-dynamic-networks","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/online-distributed-convex-optimization-on-dynamic-networks\/","title":{"rendered":"Online Distributed Convex Optimization on Dynamic Networks"},"content":{"rendered":"

S. Hosseini, A. Chapman, M. Mesbahi<\/strong><\/p>\n

IEEE Transactions on Automatic Control<\/strong><\/p>\n

\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
\n
This note presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a distributed algorithm based on dual sub-gradient averaging. A convergence rate analysis for the offline optimization, and a regret analysis for the online case, as a function of the underlying dynamic network topology are then presented for both classes of uncertainties. Application of the proposed setup is then discussed for uncertain sensor networks.<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n<\/div>\n
<\/div>\n

Links:<\/strong><\/p>\n

\"\"<\/a> \u00a0 \"\"<\/a> \u00a0 \"\"<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"

S. Hosseini, A. Chapman, M. Mesbahi IEEE Transactions on Automatic Control This note presents a distributed optimization scheme over a network of agents in the presence of cost uncertainties and over switching communication topologies. Inspired by recent advances in distributed convex optimization, we propose a distributed algorithm based on dual sub-gradient averaging. A convergence rate […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":[],"_links":{"self":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1053"}],"collection":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/comments?post=1053"}],"version-history":[{"count":2,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1053\/revisions"}],"predecessor-version":[{"id":1058,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/1053\/revisions\/1058"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=1053"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}