Composition and union of general algorithms of optimization
Mathematical programming studiesPublished 1 January 1979
Jean-Charles Fiorot, Pierre Huard
Citations23
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The study of the convergence of algorithms of optimization obtained by composition or union, taken in sense of the relaxation, is done and the obtainment of generalized fixed points in the framework of the composition or the union of algorithms obtained in a free steering way is studied.
Abstract
The study of the convergence of algorithms of optimization obtained by composition or union, taken in sense of the relaxation, is done. After having recalled the Zangwill's theorem and given two extensions we study the obtainment of generalized fixed points in the framework of the composition or the union of algorithms obtained in a free steering way for, firstly functions having a unique maximum over some particular subsets, ranges of the current point, and secondly for general functions. The validity of the different hypotheses is discussed through some examples.
Keywords
Computer ScienceMathematics
Society for Industrial and Applied Mathematics eBooksIterative Solution of Nonlinear Equations in Several Variables
6,875 Citations2000J. M. Ortega, Werner C. Rheinboldt
Convergence of Minimization Methods An Annotated List of Basic Reference Books Bibliography Author Index Subject Index.
Springer series in computational mathematicsMatrix Iterative Analysis
5,787 Citations2000Richard S. Varga
Journal of Computer and System SciencesSufficient conditions for the convergence of monotonic mathematicalprogramming algorithms
115 Citations1976R. R. Meyer
A global convergence theory for a broad class of ''monotonic'' nonlinear programming algorithms is given and actual convergence of the entire sequence of iterates and point-of-attraction theorems are established under weak hypotheses.
Revue française d automatique informatique recherche opérationnelle Analyse numériqueAlgorithmes de relaxation chaotique à retards
88 Citations1975J.C. Miellou
Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale, toute copie ou impressions de ce fichier doit contenir la présente mention of copyright.
Czech Digital Mathematics Library (Institute of Mathematics CAS)Iterations chaotiques série-parallele pour des équations non lineaires de point fixe
35 Citations1974François Robert, Michel Charnay +1 more
Numerische MathematikM�thodes num�riques pour la d�composition et la minimisation de fonctions non diff�rentiables
34 Citations1971A. Auslender
Mathematical ProgrammingOptimization algorithms and point-to-set-maps
31 Citations1975Pierre Huard
Two general nonlinear optimization algorithms generating a sequence of feasible solutions based on the concept of point-to-set mapping continuity are described and the results unify these apparently diverse approaches.
Elsevier eBooksA Method of Centers by Upper-Bounding Functions with Applications
18 Citations1970Pierre Huard
A very general procedure is developed by using an upper-bound of the F-distance to converge the method of centers with approximate centres, if the corresponding errors tend to zero.
SIAM Journal on Numerical AnalysisA General Convergence Result for Unconstrained Minimization Methods
14 Citations1972James M. Ortega, Werner C. Rheinboldt
This note extends an observation of J. Daniel and presents a general convergence theorem for iterative methods for unconstrained minimization problems which includes the previously studied gradient-related sequences, as well as sequences which arise from univariate relaxation methods.
Numerische MathematikA systematic approach to the synthesis of algorithms
10 Citations1975Gérard G. L. Meyer
This paper presents a theory which allows the systematic synthesis of a class of iterative algorithms by using a specially structured model called thep-algorithm and a set of transformations so that the new algorithm obtained by repeated application of these transformations still solves the problem.
SIAM Journal on Control and OptimizationConvergence Conditions for a Type of Algorithm Model
10 Citations1977Gérard G. L. Meyer
SIAM Journal on ControlMethodes de Decomposition pour la Minimisation d’une Fonction sur un Espace Produit
9 Citations1974B. Martinet, A. Auslender
SIAM Journal on Numerical AnalysisOn the Convergence of Algorithms with Restart
8 Citations1976R. R. Meyer
Under certain mild assumptions, it is shown that the entire sequence of iterates generated by such algorithms converges to a “desirable” point.
SIAM Journal on Control and OptimizationA Comparison of the Forcing Function and Point-to-Set Mapping Approaches to Convergence Analysis
8 Citations1977R. R. Meyer
A comparison is given between the forcing function and point-to-set mapping approaches that indicates that they are essentially mathematically equivalent for two major categories of algorithms, but that only theforcing function approach is readily extended to a third category of algorithms involving anti-jamming parameters.
Operations ResearchTechnical Note—Theorems of Convergence for Improved Nonlinear Programming Algorithms
6 Citations1973Jacques Émile Dubois
This note presents proofs of convergence of nonlinear programming algorithms under a weaker requirement than Zangwill's convergence theorems A and C: the removal of the closedness and the weakening of the adaption properties of the map-algorithm.
RAIRO Analyse numériqueConditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes
2 Citations1977Gérard G. L. Meyer