A Combined Topographical Search Strategy with Ellipsometric Application

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

A comparison deals with the advantages and disadvantages of the classical random-base, exhaustive and gradient searches and presents a precise local search combined global search control strategy including a new, systematic point selection which makes possible the escape from local minima by time. As a demonstration electrochemically etched porous silicon (PS) samples were investigated by spectroscopic ellipsometry (SE). The evaluation process (a global optimisation task) was made in different ways to see the difficulties and the differences among the evaluating possibilities. The new, topographical search (named Gradient Cube search) was compared with some classical methods (Grid search, Random or Monte-Carlo search, and Levenberg-Marquardt gradient search) and with two more complex algorithms (Genetic Algorithms and Simulated Annealing) by evaluating real measurements. The application results prove that the classical methods have difficulties to give enough reliability and precision at the same time in global optimisation tasks if the error surface is hilly. There is therefore a hard need of escaping from local minima, and a need of a systematic evaluation to avoid the uncertainty of random-base evaluation. The Gradient Cube search is an effective, systematic hill-climbing search with high precision and so it can be useful in ellipsometry.

Original languageEnglish
Pages (from-to)383-401
Number of pages19
JournalJournal of Global Optimization
Volume19
Issue number4
DOIs
Publication statusPublished - Apr 2001

Fingerprint

Search Strategy
Global optimization
Spectroscopic ellipsometry
Porous silicon
Ellipsometry
Simulated annealing
Demonstrations
Gradient
simulated annealing
Genetic algorithms
genetic algorithm
silicon
Local Minima
Global Optimization
Regular hexahedron
Evaluation
Spectroscopic Ellipsometry
Porous Silicon
Hill Climbing
Random Search

Keywords

  • Ellipsometry
  • Escaping from local minima
  • Global optimisation
  • Minimum searches
  • Topographical search

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Global and Planetary Change
  • Applied Mathematics
  • Control and Optimization

Cite this

A Combined Topographical Search Strategy with Ellipsometric Application. / Polgár, O.; Fried, M.; Lohner, T.; Bársony, I.

In: Journal of Global Optimization, Vol. 19, No. 4, 04.2001, p. 383-401.

Research output: Contribution to journalArticle

@article{6dff1d31c9d84804b13eb4e0715d1467,
title = "A Combined Topographical Search Strategy with Ellipsometric Application",
abstract = "A comparison deals with the advantages and disadvantages of the classical random-base, exhaustive and gradient searches and presents a precise local search combined global search control strategy including a new, systematic point selection which makes possible the escape from local minima by time. As a demonstration electrochemically etched porous silicon (PS) samples were investigated by spectroscopic ellipsometry (SE). The evaluation process (a global optimisation task) was made in different ways to see the difficulties and the differences among the evaluating possibilities. The new, topographical search (named Gradient Cube search) was compared with some classical methods (Grid search, Random or Monte-Carlo search, and Levenberg-Marquardt gradient search) and with two more complex algorithms (Genetic Algorithms and Simulated Annealing) by evaluating real measurements. The application results prove that the classical methods have difficulties to give enough reliability and precision at the same time in global optimisation tasks if the error surface is hilly. There is therefore a hard need of escaping from local minima, and a need of a systematic evaluation to avoid the uncertainty of random-base evaluation. The Gradient Cube search is an effective, systematic hill-climbing search with high precision and so it can be useful in ellipsometry.",
keywords = "Ellipsometry, Escaping from local minima, Global optimisation, Minimum searches, Topographical search",
author = "O. Polg{\'a}r and M. Fried and T. Lohner and I. B{\'a}rsony",
year = "2001",
month = "4",
doi = "10.1023/A:1011297022280",
language = "English",
volume = "19",
pages = "383--401",
journal = "Journal of Global Optimization",
issn = "0925-5001",
publisher = "Springer Netherlands",
number = "4",

}

TY - JOUR

T1 - A Combined Topographical Search Strategy with Ellipsometric Application

AU - Polgár, O.

AU - Fried, M.

AU - Lohner, T.

AU - Bársony, I.

PY - 2001/4

Y1 - 2001/4

N2 - A comparison deals with the advantages and disadvantages of the classical random-base, exhaustive and gradient searches and presents a precise local search combined global search control strategy including a new, systematic point selection which makes possible the escape from local minima by time. As a demonstration electrochemically etched porous silicon (PS) samples were investigated by spectroscopic ellipsometry (SE). The evaluation process (a global optimisation task) was made in different ways to see the difficulties and the differences among the evaluating possibilities. The new, topographical search (named Gradient Cube search) was compared with some classical methods (Grid search, Random or Monte-Carlo search, and Levenberg-Marquardt gradient search) and with two more complex algorithms (Genetic Algorithms and Simulated Annealing) by evaluating real measurements. The application results prove that the classical methods have difficulties to give enough reliability and precision at the same time in global optimisation tasks if the error surface is hilly. There is therefore a hard need of escaping from local minima, and a need of a systematic evaluation to avoid the uncertainty of random-base evaluation. The Gradient Cube search is an effective, systematic hill-climbing search with high precision and so it can be useful in ellipsometry.

AB - A comparison deals with the advantages and disadvantages of the classical random-base, exhaustive and gradient searches and presents a precise local search combined global search control strategy including a new, systematic point selection which makes possible the escape from local minima by time. As a demonstration electrochemically etched porous silicon (PS) samples were investigated by spectroscopic ellipsometry (SE). The evaluation process (a global optimisation task) was made in different ways to see the difficulties and the differences among the evaluating possibilities. The new, topographical search (named Gradient Cube search) was compared with some classical methods (Grid search, Random or Monte-Carlo search, and Levenberg-Marquardt gradient search) and with two more complex algorithms (Genetic Algorithms and Simulated Annealing) by evaluating real measurements. The application results prove that the classical methods have difficulties to give enough reliability and precision at the same time in global optimisation tasks if the error surface is hilly. There is therefore a hard need of escaping from local minima, and a need of a systematic evaluation to avoid the uncertainty of random-base evaluation. The Gradient Cube search is an effective, systematic hill-climbing search with high precision and so it can be useful in ellipsometry.

KW - Ellipsometry

KW - Escaping from local minima

KW - Global optimisation

KW - Minimum searches

KW - Topographical search

UR - http://www.scopus.com/inward/record.url?scp=0035306568&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035306568&partnerID=8YFLogxK

U2 - 10.1023/A:1011297022280

DO - 10.1023/A:1011297022280

M3 - Article

VL - 19

SP - 383

EP - 401

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 4

ER -