Browse/Search Results:  1-9 of 9 Help

Selected(0)Clear Items/Page:    Sort:
Stochastic proximal quasi-Newton methods for non-convex composite optimization 期刊论文
OPTIMIZATION METHODS & SOFTWARE, 2019, 卷号: 34, 期号: 5, 页码: 922-948
Authors:  Wang, Xiaoyu;  Wang, Xiao;  Yuan, Ya-xiang
Favorite  |  View/Download:19/0  |  Submit date: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  
On the Nonergodic Convergence Rate of an Inexact Augmented Lagrangian Framework for Composite Convex Programming 期刊论文
MATHEMATICS OF OPERATIONS RESEARCH, 2019, 卷号: 44, 期号: 2, 页码: 632-650
Authors:  Liu, Ya-Feng;  Liu, Xin;  Ma, Shiqian
Favorite  |  View/Download:23/0  |  Submit date:2020/01/10
inexact augmented Lagrangian framework  nonergodic convergence rate  composite convex programming  
Strong convergence and bounded perturbation resilience of a modified proximal gradient algorithm 期刊论文
Journal of Inequalities and Applications, 2018, 卷号: 2018, 期号: 1
Authors:  Guo,Yanni;  Cui,Wei
Favorite  |  View/Download:22/0  |  Submit date:2018/07/30
Strong convergence  Bounded perturbation resilience  Modified proximal gradient algorithm  Viscosity approximation  Convex minimization problem  
Inexact proximal stochastic gradient method for convex composite optimization 期刊论文
Authors:  Wang, Xiao;  Wang, Shuxiong;  Zhang, Hongchao
Favorite  |  View/Download:19/0  |  Submit date:2018/07/30
Convex composite optimization  Empirical risk minimization  Stochastic gradient  Inexact methods  Global convergence  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:16/0  |  Submit date:2018/07/30
Nonsmooth optimization  Nonlinear programming  Trust-region methods  Derivative-free optimization  Global convergence  Worst-case complexity  
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:11/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  
aparallellinesearchsubspacecorrectionmethodforcompositeconvexoptimization 期刊论文
journaloftheoperationsresearchsocietyofchina, 2015, 卷号: 3, 期号: 2, 页码: 163
Authors:  Dong Qian;  Liu Xin;  Wen Zaiwen;  Yuan Yaxiang
Favorite  |  View/Download:5/0  |  Submit date:2020/01/10
A parallel line searchsubspace correction method for composite convex optimization 期刊论文
journaloftheoperationsresearchsocietyofchina, 2015, 卷号: 3, 期号: 2, 页码: 163
Authors:  Dong Qian;  Liu Xin;  Wen Zaiwen;  Yuan Yaxiang
Favorite  |  View/Download:0/0  |  Submit date:2021/01/14
Line search  Block coordinate descent method  Domain decomposition  Jacobian-type iteration  Distributed optimization  
Optimality and duality in nondifferentiable and multiobjective programming under generalized d-Invexity 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2004, 卷号: 29, 期号: 4, 页码: 425-438
Authors:  Mishra, SK;  Wang, SY;  Lai, KK
View  |  Adobe PDF(98Kb)  |  Favorite  |  View/Download:83/10  |  Submit date:2018/07/30
Duality  Generalized D-invexity  Multiobjective Programming  Optimality  Pareto Efficient Solution