论文信息 - Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach·

Improving the Decomposition of Partially Separable Functions in the Context of Large-Scale Optimization: a First Approach·

This paper examines the question of modifying the decomposition of a partially separable function in order to improve computational efficiency of large-scale minimization algorithms using a conjugate-gradient inner iteration. The context and motivation are given and the application of a simple strategy discussed on examples extracted from the CUTE test problem collection.

P. Toint | N. Gould | A. Conn

[1] M. Powell. A method for nonlinear constraints in minimization problems , 1969 .

[2] R. Glowinski,et al. Computing Methods in Applied Sciences and Engineering , 1974 .

[3] Andreas Griewank,et al. On the unconstrained optimization of partially separable functions , 1982 .

[4] Dimitri P. Bertsekas,et al. Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[5] P. Toint,et al. Partitioned variable metric updates for large structured optimization problems , 1982 .

[6] P. Toint,et al. On Large Scale Nonlinear Least Squares Calculations , 1987 .

[7] P. Toint,et al. A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[8] P. Toint,et al. Lancelot: A FORTRAN Package for Large-Scale Nonlinear Optimization (Release A) , 1992 .

[9] S. Thomas McCormick,et al. A hierarchical algorithm for making sparse matrices sparser , 1992, Math. Program..

[10] Nicholas I. M. Gould,et al. CUTE: constrained and unconstrained testing environment , 1995, TOMS.