Open AccessHIGH ORDER ITERATIVE METHODS FOR DECOMPOSITION‐COORDINATION PROBLEMS
Author(s) -
O Vaarmann
Publication year - 2006
Publication title -
technological and economic development of economy
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.634
H-Index - 47
eISSN - 2029-4921
pISSN - 2029-4913
DOI - 10.3846/13928619.2006.9637723
Subject(s) - mathematical optimization , chebyshev filter , hyperbola , convergence (economics) , rounding , computer science , euler's formula , mathematics , tangent , iterative method , algorithm , mathematical analysis , geometry , economics , economic growth , operating system
Many real‐life optimization problems are of the multiobjective type and highdimensional. Possibilities for solving large scale optimization problems on a computer network or multiprocessor computer using a multi‐level approach are studied. The paper treats numerical methods in which procedural and rounding errors are unavoidable, for example, those arising in mathematical modelling and simulation. For the solution of involving decomposition‐coordination problems some rapidly convergent interative methods are developed based on the classical cubically convergent method of tangent hyperbolas (Chebyshev‐Halley method) and the method of tangent parabolas (Euler‐Chebyshev method). A family of iterative methods having the convergence order equal to four is also considered. Convergence properties and computational aspects of the methods under consideration are examined. The problems of their global implementation and polyalgorithmic strategy are discussed as well.