CSpace

浏览/检索结果: 共6条,第1-6条 帮助

限定条件                
已选(0)清除 条数/页:   排序方式:
Extended ADMM and BCD for nonseparable convex minimization models with quadratic coupling terms: convergence analysis and insights 期刊论文
MATHEMATICAL PROGRAMMING, 2019, 卷号: 173, 期号: 1-2, 页码: 37-77
作者:  Chen, Caihua;  Li, Min;  Liu, Xin;  Ye, Yinyu
收藏  |  浏览/下载:209/0  |  提交时间:2019/03/11
Nonseparable convex minimization  Alternating direction method of multipliers  Block coordinate descent method  Iterate convergence  Random permutation  
A smoothing SQP framework for a class of composite minimization over polyhedron 期刊论文
MATHEMATICAL PROGRAMMING, 2016, 卷号: 158, 期号: 1-2, 页码: 467-500
作者:  Liu, Ya-Feng;  Ma, Shiqian;  Dai, Yu-Hong;  Zhang, Shuzhong
收藏  |  浏览/下载:142/0  |  提交时间:2018/07/30
Composite L-q minimization  epsilon-KKT point  Nonsmooth nonconvex non-Lipschitzian optimization  Optimality condition  Smoothing approximation  Worst-case iteration complexity  
Componentwise error bounds for linear complementarity problems 期刊论文
IMA JOURNAL OF NUMERICAL ANALYSIS, 2011, 卷号: 31, 期号: 1, 页码: 348-357
作者:  Wang, Zhengyu;  Yuan, Ya-Xiang
收藏  |  浏览/下载:106/0  |  提交时间:2018/07/30
error bound  linear complementarity problem  convex quadratic programming  
A short note on the Q-linear convergence of the steepest descent method 期刊论文
MATHEMATICAL PROGRAMMING, 2010, 卷号: 123, 期号: 2, 页码: 339-343
作者:  Yuan, Ya-xiang
收藏  |  浏览/下载:117/0  |  提交时间:2018/07/30
Steepest descent  Exact line search  Q-linear  Rate of convergence  
An interior-point trust-region algorithm for general symmetric cone programming 期刊论文
SIAM JOURNAL ON OPTIMIZATION, 2007, 卷号: 18, 期号: 1, 页码: 65-86
作者:  Lu, Ye;  Yuan, Ya-Xiang
收藏  |  浏览/下载:127/0  |  提交时间:2018/07/30
interior  point algorithm  trust-region subproblem  symmetric cone  
The cyclic Barzilai-Borwein method for unconstrained optimization 期刊论文
IMA JOURNAL OF NUMERICAL ANALYSIS, 2006, 卷号: 26, 期号: 3, 页码: 604-627
作者:  Dai, Yu-Hong;  Hager, William W.;  Schittkowski, Klaus;  Zhang, Hongchao
收藏  |  浏览/下载:110/0  |  提交时间:2018/07/30
unconstrained optimization  gradient method  convex quadratic programming  non-monotone line search