中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共12条，第1-10条 帮助

限定条件    
已选(0)清除 条数/页：   排序方式：
A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds 期刊论文
MATHEMATICAL PROGRAMMING, 2022, 页码: 61
作者:  Zhou, Yuhao;  Bao, Chenglong;  Ding, Chao;  Zhu, Jun
收藏  |  浏览/下载：73/0  |  提交时间：2023/02/07
Nonsmooth manifold optimization  Semismooth Newton method  Augmented Lagrangian method  Riemannian manifold  
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.
收藏  |  浏览/下载：79/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  
Homogenization for polynomial optimization with unbounded sets 期刊论文
MATHEMATICAL PROGRAMMING, 2022, 页码: 41
作者:  Huang, Lei;  Nie, Jiawang;  Yuan, Ya-Xiang
收藏  |  浏览/下载：81/0  |  提交时间：2023/02/07
Polynomial optimization  Homogenization  Moment-SOS relaxations  Optimality conditions  
The augmented lagrangian method can approximately solve convex optimization with least constraint violation 期刊论文
MATHEMATICAL PROGRAMMING, 2022, 页码: 35
作者:  Dai, Yu-Hong;  Zhang, Liwei
收藏  |  浏览/下载：112/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
收藏  |  浏览/下载：158/0  |  提交时间：2020/05/24
Chebyshev center  Minimax  Nonconvex quadratic optimization  Semidefinite programming  Strong duality  Linear programming  Approximation  Complexity  
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
收藏  |  浏览/下载：171/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
收藏  |  浏览/下载：165/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 convergence and worst-case complexity of trust-region and regularization methods for unconstrained optimization 期刊论文
MATHEMATICAL PROGRAMMING, 2015, 卷号: 152, 期号: 1-2, 页码: 491-520
作者:  Grapiglia, Geovani N.;  Yuan, Jinyun;  Yuan, Ya-xiang
收藏  |  浏览/下载：109/0  |  提交时间：2018/07/30
Global convergence  Worst-case complexity  Trust-region methods  Regularization methods  Unconstrained Optimization  Composite nonsmooth optimization  Multiobjective optimization  
Recent advances in trust region algorithms 期刊论文
MATHEMATICAL PROGRAMMING, 2015, 卷号: 151, 期号: 1, 页码: 249-281
作者:  Yuan, Ya-xiang
收藏  |  浏览/下载：110/0  |  提交时间：2018/07/30
Trust region algorithms  Nonlinear optimization  Subproblem  Complexity  Convergence  
A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties 期刊论文
MATHEMATICAL PROGRAMMING, 2010, 卷号: 125, 期号: 1, 页码: 163-193
作者:  Liu, Xinwei;  Yuan, Yaxiang
收藏  |  浏览/下载：114/0  |  提交时间：2018/07/30
Global and local convergences  Null-space technique  Primal-dual interior-point methods  Nonlinear optimization with inequality and equality constraints