CSpace

Browse/Search Results:  1-8 of 8 Help

Selected(0)Clear Items/Page:    Sort:
Joint Base Station Clustering and Beamforming for Non-Orthogonal Multicast and Unicast Transmission With Backhaul Constraints 期刊论文
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2018, 卷号: 17, 期号: 9, 页码: 6265-6279
Authors:  Chen, Erkai;  Tao, Meixia;  Liu, Ya-Feng
Favorite  |  View/Download:33/0  |  Submit date:2018/11/16
Layered-division multiplexing (LDM)  non-orthogonal multicast and unicast transmission  branch-and-bound (BB)  sparse beamforming  convex-concave procedure  
Generalized coefficient strengthening cuts for mixed integer programming 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2018, 卷号: 70, 期号: 1, 页码: 289-306
Authors:  Chen, Wei-Kun;  Chen, Liang;  Yang, Mu-Ming;  Dai, Yu-Hong
Favorite  |  View/Download:31/0  |  Submit date:2018/07/30
Mixed integer programming  Cutting plane method  Separation algorithm  Coefficient strengthening  
Inexact proximal stochastic gradient method for convex composite optimization 期刊论文
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2017, 卷号: 68, 期号: 3, 页码: 579-618
Authors:  Wang, Xiao;  Wang, Shuxiong;  Zhang, Hongchao
Favorite  |  View/Download:24/0  |  Submit date:2018/07/30
Convex composite optimization  Empirical risk minimization  Stochastic gradient  Inexact methods  Global convergence  Complexity bound  
An Efficient Global Algorithm for Single-Group Multicast Beamforming 期刊论文
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2017, 卷号: 65, 期号: 14, 页码: 3761-3774
Authors:  Lu, Cheng;  Liu, Ya-Feng
Favorite  |  View/Download:13/0  |  Submit date:2018/07/30
Argument cuts  branch-and-bound algorithm  convex relaxation  multicasting  global optimality  transmit beamforming  
PENALTY METHODS WITH STOCHASTIC APPROXIMATION FOR STOCHASTIC NONLINEAR PROGRAMMING 期刊论文
MATHEMATICS OF COMPUTATION, 2017, 卷号: 86, 期号: 306, 页码: 1793-1820
Authors:  Wang, Xiao;  Ma, Shiqian;  Yuan, Ya-Xiang
Favorite  |  View/Download:20/0  |  Submit date:2018/07/30
Stochastic programming  nonlinear programming  stochastic approximation  penalty method  global complexity bound  
A derivative-free trust-region algorithm for composite nonsmooth optimization 期刊论文
COMPUTATIONAL & APPLIED MATHEMATICS, 2016, 卷号: 35, 期号: 2, 页码: 475-499
Authors:  Grapiglia, Geovani Nunes;  Yuan, Jinyun;  Yuan, Ya-xiang
Favorite  |  View/Download:25/0  |  Submit date:2018/07/30
Nonsmooth optimization  Nonlinear programming  Trust-region methods  Derivative-free optimization  Global convergence  Worst-case complexity  
A class of inverse dominant problems under weighted l(infinity) norm and an improved complexity bound for Radzik's algorithm 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2006, 卷号: 34, 期号: 4, 页码: 551-567
Authors:  Wang, Q;  Yang, XG;  Zhang, JZ
Favorite  |  View/Download:8/0  |  Submit date:2018/07/30
dominant set  improvement problem  inverse problem  linear fractional combinatorial optimization  polynomial time algorithm  
The complexity analysis of the inverse center location problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 1999, 卷号: 15, 期号: 2, 页码: 213-218
Authors:  Cai, MC;  Yang, XG;  Zhang, JZ
Favorite  |  View/Download:4/0  |  Submit date:2018/07/30
complexity  location problem  networks and graphs  satisfiability problem