Global Optimization with the use optimal covering

• Autorzy: Woźniak A.
• Konferencja: 18; Polish-German Seminar; Development Trends in Design of Machines and Vehicles; 2006
• Języki publikacji: EN

Abstrakty

EN

The paper describes global optimization algorithm based on Stratified Covering. Stratified means the feasible set is divided into M disjoint subsets of equal volume, and in each subset N sampling points are uniformly generated. Covering concerns method of uniform generation of points and means that sampling grid is the set of centers of N balls, which cover in the finest manner the subset. An abridget description of optimal stratified sampling and optimal covering algorithms containing only the essential of the methods is presented. for the purpose of illustrating both the actual working and the potentialities of the method, a set of computational results is presented.

Słowa kluczowe

EN

global optimization; algorithm methods

• Wydawca: Oficyna Wydawnicza Politechniki Warszawskiej
• Czasopismo: Prace Naukowe Politechniki Warszawskiej. Elektronika
• Rocznik: 2007
• Tom: z. 160
• Strony: 309--316
• Opis fizyczny: Bibliogr. 7 poz., tab., schem., wykr.

Twórcy

autor

Woźniak A.

• Institut of Control and Computation Engineering Uniwersity of Technology Warsaw,

Bibliografia

• [1] Brusov, S.A., Piyavskiy S.A. Vychislitelnye algoritmy optimal'nogo pokrytiya oblastey ploskosti. Zh. vychisl. mat. i mat. fiziki 11(2): 304-312, 1971.
• [2] Kiefer J. Sequential minimax search for a maximum. Proc. Amer. Math. Soc. 4(3): 502-508, 1953.
• [3] Niderreiter, H. Random Number Generation and Quasi-Monte Carlo Methods. Philadelphia, PA: SIAM, 1992.
• [4] Nurmela K.J., Östergård, P.R.J., Covering a Square With up to 30 Equal Circles. Research Report HUT-TCS-A62, Helsinki University of Technology, Laboratory for Theoretical Computer Science, 2000.
• [5] Pysiak, M., Metody optymalizacji globalnej wykorzystującej pokrycia. Eng. Dissertation, Warsaw University of Technology, Institute of Control and Computation Eng., 2007.
• [6] Zhigljavsky A.A., Theory of Global Random Search. Dortrecht: Kluwer Academic, 1991.
• [7] Zieliński R., Neumann P. Sochastische Verfahren zur Suche nach dem Minimum einer Funktion. Berlin: Akademie Verlag, 1983 (polish translation: Stochastyczne metody poszukiwania minimum funkcji. Warszawa: WNT, 1986).