{"paper":{"title":"$L_2$-Box Optimization for Green Cloud-RAN via Network Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Fan Zhang, Hao Wang, Qiong Wu, Yuanming Shi","submitted_at":"2017-11-29T11:41:19Z","abstract_excerpt":"In this paper, we propose a reformulation for the Mixed Integer Programming (MIP) problem into an exact and continuous model through using the $\\ell_2$-box technique to recast the binary constraints into a box with an $\\ell_2$ sphere constraint. The reformulated problem can be tackled by a dual ascent algorithm combined with a Majorization-Minimization (MM) method for the subproblems to solve the network power consumption problem of the Cloud Radio Access Network (Cloud-RAN), and which leads to solving a sequence of Difference of Convex (DC) subproblems handled by an inexact MM algorithm. Afte"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10788","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}