An interior trust region algorithm for solving linearly constrained nonlinear optimization
- 65 Downloads
In this paper, an interior point algorithm based on trust region techniques is proposed for solving nonlinear optimization problems with linear equality constraints and nonnegative variables. Unlike those existing interior-point trust region methods, this proposed method does not require that a general quadratic subproblem with a trust region bound be solved at each iteration. Instead, a system of linear equations is solved to get a search direction, and then a linesearch of Armijo type is performed in this direction to obtain a new iteration point. From a computational point of view, this approach may in general reduce a computational effort, and thus improve the computational efficiency. Under suitable conditions, it is proven that any accumulation of the sequence generated by the algorithm satisfies the first-order optimality condition.
AMS Mathematics Subject Classification90C30 65K05 49M40
Key words and phrasesTrust region method interior-point method line-search of Armijo-type KKT-point
Unable to display preview. Download preview PDF.
- 5.W. Hock and K. Schittkowski,Test Examples for Nonlinear Programming Codes, Lecture Notes in Economics and Mathematics Systems, No. 187, Springer-Verlag, Berlin, 1981Google Scholar
- 8.J. J. More,Recent development in algorithms and software for trust region methods, in Mathematical programming: The State of Art, A. Bachem, M. Grotschel and B. Korte, eds, Springer-verlag, Berlin, 1983.Google Scholar
- 10.Y. X. Yuan,Numerical Methods for Nonlinear Programming, Shanghai, Shanghai Scientific & Technical Publishers, 1992.Google Scholar