No CrossRef data available.
Article contents
An affine scaling interior point backtracking algorithm for nonlinear constrained optimisation
Published online by Cambridge University Press: 17 February 2009
Abstract
Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
In this paper we propose a new affine scaling interior trust region algorithm with a nonmonotonic backtracking technique for nonlinear equality constrained optimisation with nonnegative constraints on the variables. In order to deal with large problems, the general full trust region subproblem is decomposed into a pair of trust region subproblems in horizontal and vertical subspaces. The horizontal trust region subproblem in the algorithm is defined by minimising a quadratic function subject only to an ellipsoidal constraint in a null tangential subspace and the vertical trust region subproblem is defined by the least squares subproblem subject only to an ellipsoidal constraint. By adopting Fletcher's penalty function as the merit function, combining a trust region strategy and a nonmonotone line search, the mixing technique will switch to a backtracking step generated by the two trust region subproblems to obtain an acceptable step. The global convergence of the proposed algorithm is proved while maintaining a fast local superlinear convergence rate, which is established under some reasonable conditions. A nonmonotonic criterion is used to speed up the convergence progress in some highly nonlinear cases.
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Society 2004
References
[1]Bonnans, J. F. and Pola, C., “A trust region interior point algorithm for linear constrained optimization”, SIAM J. Optimization 7 (1997) 717–731.CrossRefGoogle Scholar
[2]Coleman, T. F. and Li, Y., “An interior trust region approach for minimization subject to bounds”, SIAM J. Optimization 6 (1996) 418–445.CrossRefGoogle Scholar
[3]Deng, N. Y., Xiao, Y. and Zhou, F. J., “A nonmonotonic trust region algorithm”, J. Optim. Theory Appl. 76 (1993) 259–285.CrossRefGoogle Scholar
[4]Grippo, L., Lampariello, F. and Lucidi, S., “A nonmonotonic line search technique for Newton's methods”, SIAM J. Numer. Anal. 23 (1986) 707–716.CrossRefGoogle Scholar
[5]Nocedal, J. and Overton, M. L., “Projectal Hessian updating algorithms for nonlinearly constrained optimization”, SIAM J. Numer. Anal. 22 (1985) 821–850.CrossRefGoogle Scholar
[6]Nocedal, J. and Yuan, Y., “Combining trust region and line search techniques”, in Advances in Nonlinear Programming (ed. Yuan, Y.), (Kluwer, Dordrecht, 1998) 153–175.CrossRefGoogle Scholar
[7]Powell, M. J. D. and Yuan, Y., “A recursive quadratic programming algorithm that uses differentiable exact penalty functions”, Math. Programming 35 (1986) 265–278.CrossRefGoogle Scholar
[8]Zhang, J. and Zhu, D.. “A projective quasi-Newton method for nonlinear optimization”, J. Comput. Appl. Math. 53 (1990) 291–307.CrossRefGoogle Scholar
[9]Zhang, J. and Zhu, D., “A trust region type doglog method for nonlinear optimization”, Optimization 21 (1990) 543–557.CrossRefGoogle Scholar
[10]Zhu, D., “Nonmonotonic projected algorithm with both trust region and line search for constrained optimization”, J. Comput. Appl. Math. 117 (2000) 35–60.CrossRefGoogle Scholar
[11]Zhu, D., “Curvilinear paths and trust region methods with nonmonotonic back tracking technique for unconstrained optimization”, J. Comput. Math. 19 (2001) 241–258.Google Scholar
[12]Zhu, D., “An interior point algorithm with nonmonotonic backtracking technique for linear constrained optimization”, J. Comput. Math. (2002) submitted.Google Scholar
You have
Access