Geodesic
A note on direct methods for approximations of sparse Hessian matrices
Applications of Mathematics, Tome 33 (1988) no. 3, pp. 171-176
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Necessity of computing large sparse Hessian matrices gave birth to many methods for their effective approximation by differences of gradients. We adopt the so-called direct methods for this problem that we faced when developing programs for nonlinear optimization. A new approach used in the frame of symmetric sequential coloring is described. Numerical results illustrate the differences between this method and the popular Powell-Toint method.
Necessity of computing large sparse Hessian matrices gave birth to many methods for their effective approximation by differences of gradients. We adopt the so-called direct methods for this problem that we faced when developing programs for nonlinear optimization. A new approach used in the frame of symmetric sequential coloring is described. Numerical results illustrate the differences between this method and the popular Powell-Toint method.
DOI : 10.21136/AM.1988.104300
Classification : 65D15, 65D25, 65F20, 65H10, 65K05, 90C30
Keywords: large sparse optimization; numerical examples; sparse Hessian matrices; finite-differences; graph-coloring; ordering scheme; coloring scheme 
@article{10_21136_AM_1988_104300,
     author = {T\r{u}ma, Miroslav},
     title = {A note on direct methods for approximations of sparse {Hessian} matrices},
     journal = {Applications of Mathematics},
     pages = {171--176},
     year = {1988},
     volume = {33},
     number = {3},
     doi = {10.21136/AM.1988.104300},
     mrnumber = {0944781},
     zbl = {0658.65058},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/AM.1988.104300/}
}
TY  - JOUR
AU  - Tůma, Miroslav
TI  - A note on direct methods for approximations of sparse Hessian matrices
JO  - Applications of Mathematics
PY  - 1988
SP  - 171
EP  - 176
VL  - 33
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.21136/AM.1988.104300/
DO  - 10.21136/AM.1988.104300
LA  - en
ID  - 10_21136_AM_1988_104300
ER  - 
%0 Journal Article
%A Tůma, Miroslav
%T A note on direct methods for approximations of sparse Hessian matrices
%J Applications of Mathematics
%D 1988
%P 171-176
%V 33
%N 3
%U http://geodesic.mathdoc.fr/articles/10.21136/AM.1988.104300/
%R 10.21136/AM.1988.104300
%G en
%F 10_21136_AM_1988_104300
Tůma, Miroslav. A note on direct methods for approximations of sparse Hessian matrices. Applications of Mathematics, Tome 33 (1988) no. 3, pp. 171-176. doi: 10.21136/AM.1988.104300

[1] T. F. Coleman J. J. Moré: Estimation of Sparse Hessian Matrices and Graph Coloring Problems. Math. Prog. 28 (1984), 243-270. | DOI | MR

[2] G. C. Everstine: A Comparison of Three Resequencing Algorithms for the Reduction of Matrix Profile and Wavefront. International Journal on Numerical Methods in Engineering 14 (1979), 837-853. | DOI | Zbl

[3] A. George J. W. H. Liu: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Inc. Englewood Cliffs. N. J. 07632, 1981. | MR

[4] P. Hanzálek J. Hřebíček J. Kučera: A Conversational Program System for Mathematical Optimization. Computer Physics Communications 41 (1986), 403 - 408. | DOI

[5] D. M. Matula L. L. Beck: Smallest-last Ordering and Clustering and Graph Coloring Algorithms. JACM 30 (1983), 417-427. | DOI | MR

[6] S. T. McCormick: Optimal Approximation of Sparse Hessians and its Equivalence to a Graph Coloring Problem. Math. Prog. 26 (1983), 153-171. | DOI | MR | Zbl

[7] M. J. D. Powell, Ph. L. Toint: On the Estimation of Sparse Hessian Matrices. SIAM on Num. Anal. 16 (1979), 1060-1074. | DOI | MR | Zbl

[8] M. N. Thapa: Optimization of Unconstrained Functions with Sparse Hessian Matrices: Newton-type Methods. Math. Prog. 19 (1984), 156-186. | MR | Zbl

[9] O. C. Zienkiewicz: The Finite Element Method. McGraw Hill, London, 1977. | Zbl

Cité par Sources :