科研之友
微信
新浪微博
Facebook
分享链接
摘要
We present a nonlinear Lagrangian method for nonconvex semi-definite programming. This nonlinear Lagrangian is generated by a Lowner operator associated with Log-Sigmoid function. Under a set of assumptions, we prove a convergence theorem, which shows that the nonlinear Lagrangian algorithm is locally convergent when the penalty parameter is less than a threshold and the error bound of the solution is proportional to the penalty parameter.
- 出版日期2009-8
- 单位大连理工大学
