论文信息 - Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms

Extensions of the continuity of point-to-set maps: Applications to fixed point algorithms

A new approach for synthetizing optimization algorithms is presented. New concepts for the continuity of point-to-set maps are given in terms of families of maps. These concepts are well adapted to construct fixed point theorems that are widely useful for synthetizing optimization methods. The general algorithms already published are shown to be particular applications and illustrations in the field of mathematical programming are given.

J. Denel | J. Denel

[1] P. Huard,et al. Optimization algorithms and point-to-set-maps , 1975, Math. Program..

[2] P. Huard. Programmation mathématique convexe , 1968 .

[3] E. M. L. Beale,et al. Nonlinear Programming: A Unified Approach. , 1970 .

[4] R. Meyer. The Validity of a Family of Optimization Methods , 1970 .

[5] V. N. Malozemov,et al. ON THE THEORY OF NON-LINEAR MINIMAX PROBLEMS , 1971 .

[6] A. M. Geoffrion. Duality in Nonlinear Programming: A Simplified Applications-Oriented Development , 1971 .

[7] D. Bertsekas,et al. A DESCENT NUMERICAL METHOD FOR OPTIMIZATION PROBLEMS WITH NONDIFFERENTIABLE COST FUNCTIONALS , 1973 .

[8] Floyd J. Gould,et al. Stability in Nonlinear Programming , 1970, Oper. Res..

[9] P. Huard,et al. A Method of Centers by Upper-Bounding Functions with Applications , 1970 .

[10] Olvi L. Mangasarian,et al. Nonlinear Programming , 1969 .

[11] W. Hogan. Point-to-Set Maps in Mathematical Programming , 1973 .

[12] Gerard G. L. Meyer,et al. Abstract models for the synthesis of optimization algorithms , 1970 .

[13] G. Dantzig,et al. On the continuity of the minimum set of a continuous function , 1967 .

[14] C. Berge,et al. Espaces topologiques : fonctions multivoques , 1966 .

[15] Implementation of gradient methods by tangential discretization , 1979 .