CSpace
(Note: the search results are based on claimed items)

Browse/Search Results:  1-4 of 4 Help

Filters            
Selected(0)Clear Items/Page:    Sort:
A new fully polynomial time approximation scheme for the interval subset sum problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
Authors:  Diao, Rui;  Liu, Ya-Feng;  Dai, Yu-Hong
Favorite  |  View/Download:10/0  |  Submit date:2018/07/30
Interval subset sum problem  Computational complexity  Solution structure  Fully polynomial time approximation scheme  Worst-case performance  
A smoothing SQP framework for a class of composite minimization over polyhedron 期刊论文
MATHEMATICAL PROGRAMMING, 2016, 卷号: 158, 期号: 1-2, 页码: 467-500
Authors:  Liu, Ya-Feng;  Ma, Shiqian;  Dai, Yu-Hong;  Zhang, Shuzhong
Favorite  |  View/Download:17/0  |  Submit date:2018/07/30
Composite L-q minimization  epsilon-KKT point  Nonsmooth nonconvex non-Lipschitzian optimization  Optimality condition  Smoothing approximation  Worst-case iteration complexity  
Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach 期刊论文
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2015, 卷号: 63, 期号: 14, 页码: 3641-3656
Authors:  Liu, Ya-Feng;  Dai, Yu-Hong;  Ma, Shiqian
Favorite  |  View/Download:11/0  |  Submit date:2018/07/30
Admission control  complexity  non-convex approximation  potential reduction algorithm  power control  sparse optimization  
Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms 期刊论文
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 卷号: 59, 期号: 3, 页码: 1142-1157
Authors:  Liu, Ya-Feng;  Dai, Yu-Hong;  Luo, Zhi-Quan
Favorite  |  View/Download:9/0  |  Submit date:2018/07/30
Complexity  coordinated beamforming  cyclic coordinate descent algorithm  global convergence  MISO interference channel