Evolutionary continuation methods for optimization problems

Oliver Schuetze, Adriana Lara, Carlos A. Coello Coello

Research output: Contribution to conferencePaper

8 Citations (Scopus)

Abstract

In this paper we develop evolutionary strategies for numerical continuation which we apply to scalar and multi-objective optimization problems. To be more precise, we will propose two different methods-an embedding algorithm and a multi-objectivization approach-which are designed to follow an implicitly defined curve where the aim can be to detect the endpoint of the curve (e.g., a root finding problem) or to approximate the entire curve (e.g., the Pareto set of a multi-objective optimization problem). We demonstrate that the novel approaches are very robust in finding the set of interest (point or curve) on several examples. Copyright 2009 ACM.
Original languageAmerican English
Pages651-658
Number of pages585
DOIs
StatePublished - 31 Dec 2009
Externally publishedYes
EventProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 -
Duration: 31 Dec 2009 → …

Conference

ConferenceProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009
Period31/12/09 → …

Fingerprint

Multiobjective optimization
optimization
curves
embedding
scalars

Cite this

Schuetze, O., Lara, A., & Coello Coello, C. A. (2009). Evolutionary continuation methods for optimization problems. 651-658. Paper presented at Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, . https://doi.org/10.1145/1569901.1569991
Schuetze, Oliver ; Lara, Adriana ; Coello Coello, Carlos A. / Evolutionary continuation methods for optimization problems. Paper presented at Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, .585 p.
@conference{3e04595b59e64d9db3674ddd0dabd107,
title = "Evolutionary continuation methods for optimization problems",
abstract = "In this paper we develop evolutionary strategies for numerical continuation which we apply to scalar and multi-objective optimization problems. To be more precise, we will propose two different methods-an embedding algorithm and a multi-objectivization approach-which are designed to follow an implicitly defined curve where the aim can be to detect the endpoint of the curve (e.g., a root finding problem) or to approximate the entire curve (e.g., the Pareto set of a multi-objective optimization problem). We demonstrate that the novel approaches are very robust in finding the set of interest (point or curve) on several examples. Copyright 2009 ACM.",
author = "Oliver Schuetze and Adriana Lara and {Coello Coello}, {Carlos A.}",
year = "2009",
month = "12",
day = "31",
doi = "10.1145/1569901.1569991",
language = "American English",
pages = "651--658",
note = "Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009 ; Conference date: 31-12-2009",

}

Schuetze, O, Lara, A & Coello Coello, CA 2009, 'Evolutionary continuation methods for optimization problems', Paper presented at Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, 31/12/09 pp. 651-658. https://doi.org/10.1145/1569901.1569991

Evolutionary continuation methods for optimization problems. / Schuetze, Oliver; Lara, Adriana; Coello Coello, Carlos A.

2009. 651-658 Paper presented at Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, .

Research output: Contribution to conferencePaper

TY - CONF

T1 - Evolutionary continuation methods for optimization problems

AU - Schuetze, Oliver

AU - Lara, Adriana

AU - Coello Coello, Carlos A.

PY - 2009/12/31

Y1 - 2009/12/31

N2 - In this paper we develop evolutionary strategies for numerical continuation which we apply to scalar and multi-objective optimization problems. To be more precise, we will propose two different methods-an embedding algorithm and a multi-objectivization approach-which are designed to follow an implicitly defined curve where the aim can be to detect the endpoint of the curve (e.g., a root finding problem) or to approximate the entire curve (e.g., the Pareto set of a multi-objective optimization problem). We demonstrate that the novel approaches are very robust in finding the set of interest (point or curve) on several examples. Copyright 2009 ACM.

AB - In this paper we develop evolutionary strategies for numerical continuation which we apply to scalar and multi-objective optimization problems. To be more precise, we will propose two different methods-an embedding algorithm and a multi-objectivization approach-which are designed to follow an implicitly defined curve where the aim can be to detect the endpoint of the curve (e.g., a root finding problem) or to approximate the entire curve (e.g., the Pareto set of a multi-objective optimization problem). We demonstrate that the novel approaches are very robust in finding the set of interest (point or curve) on several examples. Copyright 2009 ACM.

UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=72749110949&origin=inward

UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=72749110949&origin=inward

U2 - 10.1145/1569901.1569991

DO - 10.1145/1569901.1569991

M3 - Paper

SP - 651

EP - 658

ER -

Schuetze O, Lara A, Coello Coello CA. Evolutionary continuation methods for optimization problems. 2009. Paper presented at Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, . https://doi.org/10.1145/1569901.1569991