CSpace

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

限定条件    
已选(0)清除 条数/页:   排序方式:
Understanding the acceleration phenomenon via high-resolution differential equations 期刊论文
MATHEMATICAL PROGRAMMING, 2022, 卷号: 195, 期号: 1-2, 页码: 79-148
作者:  Shi, Bin;  Du, Simon S.;  Jordan, Michael, I;  Su, Weijie J.
收藏  |  浏览/下载:73/0  |  提交时间:2023/02/07
Convex optimization  First-order method  Polyak's heavy ball method  Nesterov's accelerated gradient methods  Ordinary differential equation  Lyapunov function  Gradient minimization  
The augmented lagrangian method can approximately solve convex optimization with least constraint violation 期刊论文
MATHEMATICAL PROGRAMMING, 2022, 页码: 35
作者:  Dai, Yu-Hong;  Zhang, Liwei
收藏  |  浏览/下载:108/0  |  提交时间:2023/02/07
Convex optimization  Least constraint violation  Augmented Lagrangian method  Shifted problem  Optimal value mapping  Solution mapping  Dual function  Conjugate dual  
Chebyshev center of the intersection of balls: complexity, relaxation and approximation 期刊论文
MATHEMATICAL PROGRAMMING, 2020, 页码: 29
作者:  Xia, Yong;  Yang, Meijia;  Wang, Shu
收藏  |  浏览/下载:152/0  |  提交时间:2020/05/24
Chebyshev center  Minimax  Nonconvex quadratic optimization  Semidefinite programming  Strong duality  Linear programming  Approximation  Complexity  
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
收藏  |  浏览/下载:215/0  |  提交时间:2019/03/11
Nonseparable convex minimization  Alternating direction method of multipliers  Block coordinate descent method  Iterate convergence  Random permutation  
Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction 期刊论文
MATHEMATICAL PROGRAMMING, 2017, 卷号: 164, 期号: 1-2, 页码: 341-381
作者:  Ding, Chao;  Qi, Hou-Duo
收藏  |  浏览/下载:168/0  |  提交时间:2018/07/30
Euclidean distance matrix  Convex matrix optimization  Multidimensional scaling  Nonlinear dimensionality reduction  Low-rank matrix  Error bounds  Random graph models  
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
收藏  |  浏览/下载:148/0  |  提交时间:2018/07/30
Composite L-q minimization  epsilon-KKT point  Nonsmooth nonconvex non-Lipschitzian optimization  Optimality condition  Smoothing approximation  Worst-case iteration complexity  
On the truncated conjugate gradient method 期刊论文
MATHEMATICAL PROGRAMMING, 2000, 卷号: 87, 期号: 3, 页码: 561-573
作者:  Yuan, Y
收藏  |  浏览/下载:114/0  |  提交时间:2018/07/30
unconstrained optimization  trust region  conjugate gradient