CSpace

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

限定条件    
已选(0)清除 条数/页:   排序方式:
A class of smooth exact penalty function methods for optimization problems with orthogonality constraints 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2020, 页码: 37
作者:  Xiao, Nachuan;  Liu, Xin;  Yuan, Ya-xiang
收藏  |  浏览/下载:152/0  |  提交时间:2021/01/14
Orthogonality constraint  Stiefel manifold  augmented Lagrangian method  
Stochastic proximal quasi-Newton methods for non-convex composite optimization 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2019, 卷号: 34, 期号: 5, 页码: 922-948
作者:  Wang, Xiaoyu;  Wang, Xiao;  Yuan, Ya-xiang
收藏  |  浏览/下载:161/0  |  提交时间:2020/01/10
Non-convex composite optimization  Polyak-Lojasiewicz (PL) inequality  stochastic gradient  stochastic variance reduction gradient  symmetric rank one method  rank one proximity operator  complexity bound  
An augmented Lagrangian trust region method for equality constrained optimization 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2015, 卷号: 30, 期号: 3, 页码: 559-582
作者:  Wang, Xiao;  Yuan, Yaxiang
收藏  |  浏览/下载:108/0  |  提交时间:2018/07/30
equality constraints  augmented Lagrangian function  trust region  Lagrange multiplier  penalty parameter  convergence  
A parallel decomposition algorithm for training multiclass kernel-based vector machines 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2011, 卷号: 26, 期号: 3, 页码: 431-454
作者:  Niu, Lingfeng;  Yuan, Ya-Xiang
收藏  |  浏览/下载:96/0  |  提交时间:2018/07/30
Kernel-based vector machines  decomposition method  projected gradient  parallel algorithm  
An interior-point trust-region polynomial algorithm for convex quadratic minimization subject to general convex constraints 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2008, 卷号: 23, 期号: 2, 页码: 251-258
作者:  Lu, Ye;  Yuan, Ya-Xiang
收藏  |  浏览/下载:103/0  |  提交时间:2018/07/30
interior-point algorithm  self-concordant barrier  trust-region subproblem  
A new linearization method for quadratic assignment problems 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2006, 卷号: 21, 期号: 5, 页码: 805-818
作者:  Xia, Y;  Yuan, YX
收藏  |  浏览/下载:113/0  |  提交时间:2018/07/30
quadratic assignment problem  linearization  mixed integer linear program  lower bound  cutting plane