An active-set projected trust region algorithm for box constrained optimization problems
- 142 Downloads
An active-set projected trust region algorithm is proposed for box constrained optimization problems, where the given algorithm is designed by three steps. First, the projected gradient direction which normally has better numerical performance is introduced. Second, the projected trust region direction that often possesses good convergence is defined, where the matrix of trust region subproblem is updated by limited memory strategy. Third, in order to get both good numerical performance and convergence, the authors define the final search which is the convex combination of the projected gradient direction and the projected trust region direction. Under suitable conditions, the global convergence of the given algorithm is established. Numerical results show that the presented method is competitive to other similar methods.
KeywordsActive-set strategy convergence trust region
Unable to display preview. Download preview PDF.
- Lueberger D G, Introduction to Linear and Nonlinear Programming, Chapter 11, Addison-Wesley, Reading, MA, 1973.Google Scholar
- Birgin E G and Gentil J M, Evaluating bound-constrained minimization software, Computational Optimization and Applications, DOI: 10.1007/s10589-012-9466-y.Google Scholar
- Buchley A and LeNir A, QN-like variable storage conjugate gradients, Mathematical Programming, 1983, 27: 577–593.Google Scholar
- Kanzow C, An Active-Set Type Newton Method for Constrained Nonlinear Equations, Complementarity: Applications, Algorithms, and Extensions, Edited by Ferris M C, Mangasarian O L, and Pang J S, Kluwer Academic Publishers, Dondrecht, Holland, 2001.Google Scholar