An approximation method for the optimization of continuous functions of n variables by densifying their domains

Most of the known optimization methods for a given continuous function f defined on a compact set H = i=1,..,n[ai,bi] require strong conditions on f. In the early 1980s, Cherruault proposed a method, called ALIENOR which was able to reduce the multidimensional optimization problem to another one-dim...

Full description

Saved in:
Bibliographic Details
Published inKybernetes Vol. 28; no. 2; pp. 164 - 180
Main Authors Mora, Gaspar, Cherruault, Yves
Format Journal Article
LanguageEnglish
Published London MCB UP Ltd 01.03.1999
Emerald Group Publishing Limited
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Most of the known optimization methods for a given continuous function f defined on a compact set H = i=1,..,n[ai,bi] require strong conditions on f. In the early 1980s, Cherruault proposed a method, called ALIENOR which was able to reduce the multidimensional optimization problem to another one-dimensional optimization: the optimization of the restriction fh* of f to some adequate -dense curve h into the domain H. The characterization, the generation of such curves as well as the theoretic calculation times associated with them, have been studied previously by the authors. Their consequences and the general problem concerning the error in the approximation to global minimum of f and the minimization of the error itself, that such reduction produces, will be the subject of this paper.
Bibliography:original-pdf:0670280202.pdf
istex:C2C633587F575DE4B925AD4338FC2AC03FDF6C9B
ark:/67375/4W2-ZD2HH1K1-S
filenameID:0670280202
href:03684929910258798.pdf
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0368-492X
1758-7883
DOI:10.1108/03684929910258798