×

Truncated partitioning group correction algorithms for large-scale sparse unconstrained optimization. (English) Zbl 1125.65051

The work is a joining and development of the methods of R. S. Dembo, S. C. Eisenstat, and T. Steihaug [SIAM J. Numer. Anal. 19, 400–408 (1982; Zbl 0478.65030)], R. S. Dembo and T. Steihaug [Math. Program. 26, 190–212 (1983; Zbl 0523.90078)] and J. X. Li and H. W. Zhang [Appl. Math. Comput. 186, No. 1, 365–378 (2007; Zbl 1171.65047)].
Local and global versions of the algorithm are considered. A good subject survey and many numerical examples are presented by which this method and similar ones are compared.

MSC:

65K05 Numerical mathematical programming methods
90C30 Nonlinear programming

Software:

LANCELOT
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Colson, B.; Toint, Ph. L., A derivative-free algorithm for sparse unconstrained optimization problems, (Siddiqi, A. H.; Kocvara, M., Trends in Industrial and Applied Mathematics. Trends in Industrial and Applied Mathematics, Proceedings of the 1st International Conference on Industrial and Applied Mathematics of the Indian Subcontinent (2002), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht), 131-147
[2] Conn, A. R.; Gould, N. I.M.; Toint, Ph. L., An introduction to the structure of large scale nonlinear optimization problems and the LANCELOT project, (Glowinski, R.; Lichnewsky, A., Computing Methods in Applied Sciences and Engineering (1990), SIAM: SIAM Philadelphia, USA), 42-51
[3] Curtis, A. R.; Powell, M. J.D.; Reid, J. K., On the estimation of sparse Jacobian matrices, IMA J. Appl. Math., 13, 117-119 (1974) · Zbl 0273.65036
[4] Dembo, R. S.; Eisenstat, S. C.; Steihaug, T., Inexact Newton methods, SIAM J. Numer. Anal., 19, 400-408 (1982) · Zbl 0478.65030
[5] Dembo, R. S.; Steihaug, T., Truncated-Newton algorithms for large-scale unconstrained optimization, Math. Program., 26, 190-212 (1983) · Zbl 0523.90078
[6] Dennis, J. E.; Moré, J. J., Quasi-Newton methods, motivation and theory, SIAM Rev., 19, 46-89 (1977) · Zbl 0356.65041
[7] Dennis, J. E.; Schnabel, R. B., Numerical methods for unconstrained optimization and nonlinear equations (1996), Society for Industrial and Applied Mathematics: Society for Industrial and Applied Mathematics Philadelphia · Zbl 0847.65038
[8] Feng, G. C., Iterative solution methods for systems of nonlinear equations, (Chinese (1989), Shanghai Science and Technology Press: Shanghai Science and Technology Press Shanghai, China)
[9] Fletcher, R., An optimal positive definite update for sparse Hessian matrices, SIAM J. Optim., 5, 192-218 (1995) · Zbl 0824.65038
[10] Gill, P.; Murray, W.; Wright, M. H., Practical optimization (1981), Academic Press: Academic Press London · Zbl 0503.90062
[11] Griewank, A.; Corliss, G. F., Automatic Differentiation of Algorithms: Theory, Implementation, and Application (1991), SIAM: SIAM Philadelphia, USA
[12] Li, G. Y., Successive column correction algorithms for solving sparse nonlinear systems of equations, Math. Program., 43, 187-207 (1989) · Zbl 0675.65045
[13] G.Y. Li, Successive element correction algorithms for sparse unconstrained optimization, TR91-34, Department of Mathematical Sciences, Rice University, Houston, Texas, 1991.; G.Y. Li, Successive element correction algorithms for sparse unconstrained optimization, TR91-34, Department of Mathematical Sciences, Rice University, Houston, Texas, 1991.
[14] G.Y. Li, A diagonal-secant update technique for sparse unconstrained optimization, TR92-1, Center for Research on Parallel Computation, Rice University, Houston, Texas, 1992.; G.Y. Li, A diagonal-secant update technique for sparse unconstrained optimization, TR92-1, Center for Research on Parallel Computation, Rice University, Houston, Texas, 1992.
[15] J.X. Li, H.W. Zhang, On the convergence of partitioning group correction algorithms. Appl. Math. Comput., doi:doi:10.1016/j.amc.2006.07.107.; J.X. Li, H.W. Zhang, On the convergence of partitioning group correction algorithms. Appl. Math. Comput., doi:doi:10.1016/j.amc.2006.07.107. · Zbl 1171.65047
[16] Li, J. X.; Zhang, H. W., Partitioning group correction Cholesky techniques for large scale sparse unconstrained optimization, Appl. Math. Comput., 182, 1010-1020 (2006) · Zbl 1111.65053
[17] Ortega, J. M.; Rheinboldt, W. C., Iterative solution of nonlinear equations in several variables (1970), Academic Press: Academic Press New York · Zbl 0241.65046
[18] Polak, E.; Mayne, D. Q.; Higgins, J. E., Superlinearly convergent algorithm for Min-Max problems, J. Optim Theory Applicat., 69, 407-439 (1991) · Zbl 0724.90066
[19] T. Steihaug, Quasi-Newton methods for Large scale nonlinear problems, Ph.D. dissertation, Yale University (New Haven, CT, 1980). Also available as Working Paper, Series B No. 49.; T. Steihaug, Quasi-Newton methods for Large scale nonlinear problems, Ph.D. dissertation, Yale University (New Haven, CT, 1980). Also available as Working Paper, Series B No. 49.
[20] Powell, M. J.D.; Toint, Ph. L., On the estimation of sparse Hessian matrices, SIAM J. Numer. Anal., 16, 1060-1074 (1979) · Zbl 0426.65025
[21] Toint, Ph. L., On sparse and symmetric matrix updating subject to a linear equation, Math. Comput., 31, 954-961 (1977) · Zbl 0379.65034
[22] Zhang, H. W.; Li, J. X.; Wang, J., Partitioned group correction technique for large scale sparse unconstrained optimization, Numer. Math. A J. Chin. Univ., Suppl., 27, 358-361 (2005)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.