CSpace

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

限定条件    
已选(0)清除 条数/页:   排序方式:
The augmented lagrangian method can approximately solve convex optimization with least constraint violation 期刊论文
MATHEMATICAL PROGRAMMING, 2022, 页码: 35
作者:  Dai, Yu-Hong;  Zhang, Liwei
收藏  |  浏览/下载:122/0  |  提交时间:2023/02/07
Convex optimization  Least constraint violation  Augmented Lagrangian method  Shifted problem  Optimal value mapping  Solution mapping  Dual function  Conjugate dual  
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
收藏  |  浏览/下载:233/0  |  提交时间:2019/03/11
Nonseparable convex minimization  Alternating direction method of multipliers  Block coordinate descent method  Iterate convergence  Random permutation  
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
收藏  |  浏览/下载:121/0  |  提交时间:2018/07/30
Global and local convergences  Null-space technique  Primal-dual interior-point methods  Nonlinear optimization with inequality and equality constraints