{"id":962,"date":"2018-08-17T12:37:46","date_gmt":"2018-08-17T20:37:46","guid":{"rendered":"http:\/\/depts.washington.edu\/uwrainlab\/?page_id=962"},"modified":"2018-08-17T12:37:46","modified_gmt":"2018-08-17T20:37:46","slug":"weighted-network-design-with-cardinality-constraints-via-alternating-direction-method-of-multipliers","status":"publish","type":"page","link":"http:\/\/depts.washington.edu\/uwrainlab\/weighted-network-design-with-cardinality-constraints-via-alternating-direction-method-of-multipliers\/","title":{"rendered":"Weighted Network Design with Cardinality Constraints via Alternating Direction Method of Multipliers"},"content":{"rendered":"<p><strong>S. Chuangchuang, R. Dai, and M. Mesbahi<\/strong><\/p>\n<p><b><span class=\"style2\">IEEE Transactions on Control of Network Systems<\/span><\/b><\/p>\n<p>This paper examines simultaneous design of the network topology and the corresponding edge weights in presence of a cardinality constraint on the edge set. Network properties of interest for this design problem lead to optimization formulations with convex objectives, convex constraint sets, and cardinality constraints. This class of problems is referred to as Cardinality-Constrained Optimization Problem (CCOP); the cardinality constraint generally makes CCOPs NP-hard. The traditional relaxation methods, such as the\u00a0<span id=\"MathJax-Element-1-Frame\" class=\"MathJax\" tabindex=\"0\"><span id=\"MathJax-Span-1\" class=\"math\" role=\"math\"><span id=\"MathJax-Span-2\" class=\"mrow\"><span id=\"MathJax-Span-3\" class=\"msubsup\"><span id=\"MathJax-Span-4\" class=\"mi\">l<\/span><span id=\"MathJax-Span-5\" class=\"mn\">1<\/span><\/span><\/span><\/span><\/span>-regularization, to approximately represent the cardinality function may fail when applied to the cardinality constraint. In this work, a customized Alternating Direction Method of Multipliers (ADMM) algorithm aiming to improve the scalability of the solution strategy for large-scale CCOPs is proposed. This algorithm utilizes the special structure of the problem formulation to obtain closed-form solutions during each iterative step of the corresponding ADMM updates.<\/p>\n<p><strong>Links:<\/strong><\/p>\n<p><a href=\"https:\/\/ieeexplore.ieee.org\/document\/8246586\/\"><img loading=\"lazy\" class=\"alignnone wp-image-810\" src=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/download.png\" alt=\"\" width=\"26\" height=\"26\" srcset=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/download.png 225w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/download-150x150.png 150w\" sizes=\"(max-width: 26px) 100vw, 26px\" \/><\/a> \u00a0 <a href=\"https:\/\/ieeexplore.ieee.org\/stamp\/stamp.jsp?tp=&amp;arnumber=8246586\"><img loading=\"lazy\" class=\"alignnone wp-image-811\" src=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/image_preview.png\" alt=\"\" width=\"31\" height=\"31\" srcset=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/image_preview.png 250w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/image_preview-150x150.png 150w\" sizes=\"(max-width: 31px) 100vw, 31px\" \/><\/a> \u00a0 <a href=\"https:\/\/scholar.google.com\/scholar?hl=en&amp;as_sdt=0%2C48&amp;q=Weighted+Network+Design+with+Cardinality+Constraints+via+Alternating+Direction+Method+of+Multipliers&amp;btnG=#d=gs_cit&amp;p=&amp;u=%2Fscholar%3Fq%3Dinfo%3Arx2xPZDxEjkJ%3Ascholar.google.com%2F%26output%3Dcite%26scirp%3D0%26hl%3Den\"><img loading=\"lazy\" class=\"alignnone wp-image-809\" src=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-300x97.png\" alt=\"\" width=\"65\" height=\"21\" srcset=\"http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-300x97.png 300w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-768x248.png 768w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_-1024x330.png 1024w, http:\/\/depts.washington.edu\/uwrainlab\/wordpress\/wp-content\/uploads\/2018\/07\/BibTeX_logo.svg_.png 1200w\" sizes=\"(max-width: 65px) 100vw, 65px\" \/><\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>S. Chuangchuang, R. Dai, and M. Mesbahi IEEE Transactions on Control of Network Systems This paper examines simultaneous design of the network topology and the corresponding edge weights in presence of a cardinality constraint on the edge set. Network properties of interest for this design problem lead to optimization formulations with convex objectives, convex constraint [&hellip;]<\/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\/962"}],"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=962"}],"version-history":[{"count":1,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/962\/revisions"}],"predecessor-version":[{"id":966,"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/pages\/962\/revisions\/966"}],"wp:attachment":[{"href":"http:\/\/depts.washington.edu\/uwrainlab\/wp-json\/wp\/v2\/media?parent=962"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}