Min-maxing interference alignment algorithm as a semidefinite programming problem

Author(s):  
Mohammed El-Absi ◽  
Mohamed El-Hadidy ◽  
Thomas Kaiser
2016 ◽  
Vol 33 (04) ◽  
pp. 1650025 ◽  
Author(s):  
Jia Wu ◽  
Yi Zhang ◽  
Liwei Zhang ◽  
Yue Lu

This paper is devoted to the study of solving method for a type of inverse linear semidefinite programming problem in which both the objective parameter and the right-hand side parameter of the linear semidefinite programs are required to adjust. Since such kind of inverse problem is equivalent to a mathematical program with semidefinite cone complementarity constraints which is a rather difficult problem, we reformulate it as a nonconvex semi-definte programming problem by introducing a nonsmooth partial penalty function to penalize the complementarity constraint. The penalized problem is actually a nonsmooth DC programming problem which can be solved by a sequential convex program approach. Convergence analysis of the penalty models and the sequential convex program approach are shown. Numerical results are reported to demonstrate the efficiency of our approach.


2014 ◽  
Vol 2014 (2) ◽  
pp. 49-50 ◽  
Author(s):  
Sara Teodoro ◽  
Adão Silva ◽  
Rui Dinis ◽  
Daniel Castanheira ◽  
Atílio Gameiro

Sign in / Sign up

Export Citation Format

Share Document