A comparative study of several general convergence conditions for algorithms modeled by point-to-set maps

A general structure is established that allows the comparison of various conditions that are sufficient for convergence of algorithms that can be modeled as the recursive application of a point-to-set map. This structure is used to compare several earlier sufficient conditions as well as three new sets of sufficient conditions. One of the new sets of conditions is shown to be the most general in that all other sets of conditions imply this new set. This new set of conditions is also extended to the case where the point-to-set map can change from iteration to iteration.

[1]  R. Meyer.  A convergence theory for a class of anti-jamming strategies , 1977 .

[2]  R. Klessig.  A General Theory of Convergence for Constrained Optimization Algorithms that Use Antizigzagging Provisions , 1974 .

[3]  Boris Polyak.  Gradient methods for the minimisation of functionals , 1963 .

[4]  William W. Hogan,et al.  Applications of a general convergence theory for outer approximation algorithms , 1973, Math. Program..

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

[6]  Melanie L. Lenard,et al.  Practical convergence conditions for unconstrained optimization , 1973, Math. Program..

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

[8]  E. Polak,et al.  On the convergence of optimization algorithms , 1969 .

[9]  A convergence theory for a class of nonlinear programming problems. , 1973 .

[10]  E. Polak,et al.  On the Use of Approximations in Algorithms for Optimization Problems with Equality and Inequality Constraints , 1978 .

[11]  Jacques Dubois.  Technical Note - Theorems of Convergence for Improved Nonlinear Programming Algorithms , 1973, Oper. Res..

[12]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

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

[14]  J. Daniel.  Convergent Step-Sizes for Gradient-Like Feasible Direction Algorithms for Constrained Optimization , 1970 .

[15]  E. Polak.  Introduction to linear and nonlinear programming , 1973 .

[16]  A. F. Veinott,et al.  On the Convergence of Some Feasible Direction Algorithms for Nonlinear Programming , 1967 .

[17]  L. Armijo.  Minimization of functions having Lipschitz continuous first partial derivatives. , 1966 .

[18]  Robert R. Meyer,et al.  Sufficient Conditions for the Convergence of Monotonic Mathematical Programming Algorithms , 1976, J. Comput. Syst. Sci..

[19]  R. Elkin.  Convergence theorems for gauss-seidel and other minimization algorithms , 1968 .

[20]  P. Wolfe.  Convergence Conditions for Ascent Methods. II , 1969 .

[21]  R. Sargent,et al.  On the convergence of sequential minimization algorithms , 1973 .

[22]  W. Zangwill.  Convergence Conditions for Nonlinear Programming Algorithms , 1969 .

[23]  A General Convergence Result for Unconstrained Minimization Methods , 1972 .

[24]  E. Polak,et al.  Computational methods in optimization : a unified approach , 1972 .

[25]  R. Meyer.  A Comparison of the Forcing Function and Point-to-Set Mapping Approaches to Convergence Analysis , 1977 .

[26]  E. Polak,et al.  An adaptive precision gradient method for optimal control. , 1973 .

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

[28]  E. Polak.  On the Implementation of Conceptual Algorithms , 1970 .

[29]  B. Eaves,et al.  Generalized Cutting Plane Algorithms , 1971 .

[30]  GEmaD G. L. MEYER,et al.  Algorithm Model for Penalty Functions-Type Iterative Procedures , 1974, J. Comput. Syst. Sci..

[31]  Convergence Conditions for a Type of Algorithm Model , 1977 .