期刊文献+

On KKT points of Celis-Dennis-Tapia subproblem 被引量:1

On KKT points of Celis-Dennis-Tapia subproblem
原文传递
导出
摘要 The Celis-Dennis-Tapia(CDT) problem is a subproblem of the trust region algorithms for the constrained optimization. CDT subproblem is studied in this paper. It is shown that there exists the KKT point such that the Hessian matrix of the Lagrangian is positive semidefinite,if the multipliers at the global solution are not unique. Next the second order optimality conditions are also given, when the Hessian matrix of Lagrange at the solution has one negative eigenvalue.And furthermore, it is proved that all feasible KKT points satisfying that the corresponding Hessian matrices of Lagrange have one negative eigenvalue are the local optimal solutions of the CDT subproblem. The Celis-Dennis-Tapia(CDT) problem is a subproblem of the trust region algorithms for the constrained optimization. CDT subproblem is studied in this paper. It is shown that there exists the KKT point such that the Hessian matrix of the Lagrangian is positive semidefinite, if the multipliers at the global solution are not unique. Next the second order optimality conditions are also given, when the Hessian matrix of Lagrange at the solution has one negative eigenvalue. And furthermore, it is proved that all feasible KKT points satisfying that the corresponding Hessian matrices of Lagrange have one negative eigenvalue are the local optimal solutions of the CDT subproblem.
作者 LI Gaidi
出处 《Science China Mathematics》 SCIE 2006年第5期651-659,共9页 中国科学:数学(英文版)
基金 supported by the startup grants for doctoral research and the school grants for mathematical research of Beijing University of Technology the National Natural Science Foundation of China(Grant No.10401038).
关键词 CDT subproblem LOCAL solution OPTIMALITY condition SADDLE point. CDT subproblem, local solution, optimality condition, saddle point.
  • 相关文献

参考文献1

二级参考文献14

  • 1M. M. El-Alem,R. A. Tapia.Numerical experience with a polyhedral-norm CDT trust-region algorithm[J]. Journal of Optimization Theory and Applications . 1995 (3)
  • 2Yin Zhang.Computing a Celis-Dennis-Tapia trust-region step for equality constrained optimization[J]. Mathematical Programming . 1992 (1-3)
  • 3M. J. D. Powell,Y. Yuan.A trust region algorithm for equality constrained optimization[J]. Mathematical Programming . 1990 (1-3)
  • 4Y. Yuan.On a subproblem of trust region algorithms for constrained optimization[J]. Mathematical Programming . 1990 (1-3)
  • 5Powell M J D,Yuan Y X.A trust region algorithm for equality constrained optimization. Mathematical Programming . 1991
  • 6Yuan Y.On a subproblem of trust region algorithms for constrained optimization. Mathematical Programming . 1990
  • 7El-Alem,M. M.,Tapia,R. A.Numerical Experience with a Polyhedral Norm CDT Trust-Region Algorithm. Journal of Optimization . 1995
  • 8JJ More,DC Sorensen.Computing a trust region step. SIAM Journal on Scientific and Statistical Computing . 1983
  • 9Yuan,Y.A dual algorithm for minimizing a quadratic function with two quadratic constraints. Journal of Computational Mathematics . 1991
  • 10Zhang,Y.Computing a Celis-Dennis-Tapia Trust-Region Step for Equality Constrained Optimization. Mathematical Programming . 1992

共引文献4

同被引文献3

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部