Pattern search methods for use-provided points

Pedro Alberto; Fernando Nogueira; Humberto Rocha; Luis N. Vicente

doi:10.1007/3-540-45718-6_11

Pattern search methods for use-provided points

Pedro Alberto
, Fernando Nogueira
, Humberto Rocha
, Luis N. Vicente

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Citation (Scopus)

Abstract

We show how pattern search methods can be adapted to the optimization problem contexts where there are ways to provide points that can lead to an objective function decrease. The paradigm here is that it is the user and the optimization algorithm together, and not the optimization algorithm alone, that lead the calculation of new points. We are especially concerned with problems where objective function evaluations are expensive and for which parallel computing is available.

Original language	English
Title of host publication	Computational Science – ICCS 2001 - International Conference, Proceedings
Editors	Vassil N. Alexandrov, Jack J. Dongarra, Benjoe A. Juliano, Rene S. Renner, C.J. Kenneth Tan
Publisher	Springer Verlag
Pages	95-98
Number of pages	4
ISBN (Print)	3540422331, 9783540422334
DOIs	https://doi.org/10.1007/3-540-45718-6_11
Publication status	Published - 2001
Event	International Conference on Computational Science, ICCS 2001 - San Francisco, United States Duration: 28 May 2001 → 30 May 2001

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2074
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Computational Science, ICCS 2001
Country/Territory	United States
City	San Francisco
Period	28/05/01 → 30/05/01

Access to Document

10.1007/3-540-45718-6_11

Cite this

Alberto, P., Nogueira, F., Rocha, H., & Vicente, L. N. (2001). Pattern search methods for use-provided points. In V. N. Alexandrov, J. J. Dongarra, B. A. Juliano, R. S. Renner, & C. J. Kenneth Tan (Eds.), Computational Science – ICCS 2001 - International Conference, Proceedings (pp. 95-98). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074). Springer Verlag. https://doi.org/10.1007/3-540-45718-6_11

Alberto, Pedro ; Nogueira, Fernando ; Rocha, Humberto et al. / Pattern search methods for use-provided points. Computational Science – ICCS 2001 - International Conference, Proceedings. editor / Vassil N. Alexandrov ; Jack J. Dongarra ; Benjoe A. Juliano ; Rene S. Renner ; C.J. Kenneth Tan. Springer Verlag, 2001. pp. 95-98 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{eed93bb82afd426290a1d905476f7674,

title = "Pattern search methods for use-provided points",

abstract = "We show how pattern search methods can be adapted to the optimization problem contexts where there are ways to provide points that can lead to an objective function decrease. The paradigm here is that it is the user and the optimization algorithm together, and not the optimization algorithm alone, that lead the calculation of new points. We are especially concerned with problems where objective function evaluations are expensive and for which parallel computing is available.",

author = "Pedro Alberto and Fernando Nogueira and Humberto Rocha and Vicente, \{Luis N.\}",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2001.; International Conference on Computational Science, ICCS 2001 ; Conference date: 28-05-2001 Through 30-05-2001",

year = "2001",

doi = "10.1007/3-540-45718-6\_11",

language = "English",

isbn = "3540422331",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "95--98",

editor = "Alexandrov, \{Vassil N.\} and Dongarra, \{Jack J.\} and Juliano, \{Benjoe A.\} and Renner, \{Rene S.\} and \{Kenneth Tan\}, C.J.",

booktitle = "Computational Science – ICCS 2001 - International Conference, Proceedings",

address = "Germany",

}

Alberto, P, Nogueira, F, Rocha, H & Vicente, LN 2001, Pattern search methods for use-provided points. in VN Alexandrov, JJ Dongarra, BA Juliano, RS Renner & CJ Kenneth Tan (eds), Computational Science – ICCS 2001 - International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2074, Springer Verlag, pp. 95-98, International Conference on Computational Science, ICCS 2001, San Francisco, United States, 28/05/01. https://doi.org/10.1007/3-540-45718-6_11

Pattern search methods for use-provided points. / Alberto, Pedro; Nogueira, Fernando; Rocha, Humberto et al.
Computational Science – ICCS 2001 - International Conference, Proceedings. ed. / Vassil N. Alexandrov; Jack J. Dongarra; Benjoe A. Juliano; Rene S. Renner; C.J. Kenneth Tan. Springer Verlag, 2001. p. 95-98 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2074).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Pattern search methods for use-provided points

AU - Alberto, Pedro

AU - Nogueira, Fernando

AU - Rocha, Humberto

AU - Vicente, Luis N.

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2001.

PY - 2001

Y1 - 2001

N2 - We show how pattern search methods can be adapted to the optimization problem contexts where there are ways to provide points that can lead to an objective function decrease. The paradigm here is that it is the user and the optimization algorithm together, and not the optimization algorithm alone, that lead the calculation of new points. We are especially concerned with problems where objective function evaluations are expensive and for which parallel computing is available.

AB - We show how pattern search methods can be adapted to the optimization problem contexts where there are ways to provide points that can lead to an objective function decrease. The paradigm here is that it is the user and the optimization algorithm together, and not the optimization algorithm alone, that lead the calculation of new points. We are especially concerned with problems where objective function evaluations are expensive and for which parallel computing is available.

UR - https://www.scopus.com/pages/publications/23044525968

U2 - 10.1007/3-540-45718-6_11

DO - 10.1007/3-540-45718-6_11

M3 - Conference contribution

AN - SCOPUS:23044525968

SN - 3540422331

SN - 9783540422334

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 95

EP - 98

BT - Computational Science – ICCS 2001 - International Conference, Proceedings

A2 - Alexandrov, Vassil N.

A2 - Dongarra, Jack J.

A2 - Juliano, Benjoe A.

A2 - Renner, Rene S.

A2 - Kenneth Tan, C.J.

PB - Springer Verlag

T2 - International Conference on Computational Science, ICCS 2001

Y2 - 28 May 2001 through 30 May 2001

ER -

Alberto P, Nogueira F, Rocha H, Vicente LN. Pattern search methods for use-provided points. In Alexandrov VN, Dongarra JJ, Juliano BA, Renner RS, Kenneth Tan CJ, editors, Computational Science – ICCS 2001 - International Conference, Proceedings. Springer Verlag. 2001. p. 95-98. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-45718-6_11

Pattern search methods for use-provided points

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this