Abstract
In this paper, we propose an active set modified Polak–Ribiére–Polyak method for solving large-scale optimization with simple bounds on the variables. The active set is guessed by an identification technique at each iteration and the recently developed modified Polak–Ribiére–Polyak method is used to update the variables with indices outside of the active set. Under appropriate conditions, we show that the proposed method is globally convergent. Numerical experiments are presented using box constrained problems in the CUTEr test problem libraries.
Similar content being viewed by others
References
Gould, N.I.M., Orban, D., Toint, P.L.: Numerical methods for large-scale nonlinear optimization. Acta Numer. 14, 299–361 (2005)
Burdakov, O.P., Martínez, J.M., Pilotta, E.A.: A limited-memory multipoint symmetric secant method for bound constrained optimization. Ann. Oper. Res. 117, 51–70 (2002)
Hager, W.W., Zhang, H.: A new active set algorithm for box constrained optimization. SIAM J. Optim. 17, 526–557 (2006)
Goldfarb, D.: Extension of Davidson’s variable metric method to maximization under linear inequality and constraints. SIAM J. Appl. Math. 17, 739–764 (1969)
Dai, Y.H., Fletcher, R.: Projected Barzilai–Borwein methods for large-scale box-constrained quadratic programming. Numer. Math. 100, 21–47 (2005)
Birgin, E.G., Martínez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101–125 (2002)
Facchinei, F., Júdice, J., Soares, J.: An active set newton algorithm for large-scale nonlinear programs with box Canstranits. SIAM J. Optim. 8, 158–186 (1998)
Facchinei, F., Lucidi, S., Palagi, L.: A truncated newton algorithm for large scale box constrained optimization. SIAM J. Optim. 12, 1100–1125 (2002)
Lin, C.J., Moré, J.J.: Newton’s method for large bound-constrained optimization problems. SIAM J. Optim. 9, 1100–1127 (1999)
Moré, J.J., Toraldo, G.: Algorithms for bound constrained quadratic programming problems. Numer. Math. 4, 377–400 (1989)
Ni, Q., Yuan, Y.X.: A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization. Math. Comput. 66, 1509–1520 (1997)
Xiao, Y.H., Hu, Q.G.: Subspace Barzilai–Borwein gradient method for large-scale bound constrained optimization. Appl. Math. Optim. 58, 275–290 (2008)
Birgin, E.G., Martínez, J.M., Raydan, M.: Nonmonotone spectral projected gradient methods on convex sets. SIAM J. Optim. 10, 1121–1196 (2000)
Hager, W.W., Zhang, H.: A survey of nonlinear conjugate gradient methods. Pac. J. Optim. 2, 35–58 (2006)
Zhang, L., Zhou, W.J., Li, D.H.: A descent modified Polak–Ribiere–Polyak conjugate gradient method and its global convergence. IMA J. Numer. Anal. 26, 629–640 (2006)
Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, P.L.: CUTE: constrained and unconstrained testing environment. ACM Trans. Math. Softw. 21, 123–160 (1995)
Birgin, E.G., Martínez, J.M., Raydan, M.: Algorithm 813: SPG-software for convex-constrained optimization. ACM Trans. Math. Softw. 27, 340–349 (2001)
Dolan, E.D., Moré, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201–213 (2002)
Acknowledgements
We would like to thank the referees for their detailed comments and suggestions that have led to a significant improvement of the paper. We also thank the Professors E.G. Birgin, J.M. Martínez, and M. Raydan for their SPG2 code and Professors W.W.Hager and H. Zhang for their ASA code for numerical comparison. W. Cheng’s research was supported by the NSF of China via grant (11071087, 11101081) and by Foundation for Distinguished Young Talents in Higher Education of Guangdong, China LYM10127. D. Li’s research is supported by the major project of the Ministry of Education of China Grant 309023 and the NSF of China Grant 11071087.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by F. Giannessi.
Rights and permissions
About this article
Cite this article
Cheng, W., Li, D. An Active Set Modified Polak–Ribiére–Polyak Method for Large-Scale Nonlinear Bound Constrained Optimization. J Optim Theory Appl 155, 1084–1094 (2012). https://doi.org/10.1007/s10957-012-0091-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-012-0091-9