https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Adaptive Radial Basis Algorithms (ARBF) for Expensive Black-Box Global MINLP Optimization
Mälardalen University, Department of Mathematics and Physics. (Applied Optimization)
Tomlab Optimization Inc, Sweden.
Mälardalen University, School of Education, Culture and Communication. (Applied Optimization)
2008 (English)In: SIOPT08 - Abstracts, 2008, p. 132-Conference paper, Oral presentation with published abstract (Refereed)
Abstract [en]

Improvements of the adaptive radial basis function algo-rithm (ARBF) for computationally costly optimization are presented. A new target value search algorithm and modifications to improve robustness and speed are discussed. The algoritm is implemented in solver ARBFMIP in the TOM-LAB Optimization Environment (http://tomopt.com/). Solvers in TOMLAB are used to solve global and local subproblems. Results and comparisons with other solvers are presented for global optimization test problems. Performance on costly real-life applications are reported.

Place, publisher, year, edition, pages
2008. p. 132-
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:mdh:diva-5343OAI: oai:DiVA.org:mdh-5343DiVA, id: diva2:160487
Conference
SIAM Optimization, Boston, USA, 10-13 May, 2008
Available from: 2009-02-13 Created: 2009-02-13 Last updated: 2022-10-14Bibliographically approved
In thesis
1. Algorithms for Costly Global Optimization
Open this publication in new window or tab >>Algorithms for Costly Global Optimization
2009 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

There exists many applications with so-called costly problems, which means that the objective function you want to maximize or minimize cannot be described using standard functions and expressions. Instead one considers these objective functions as ``black box'' where the parameter values are sent in and a function value is returned. This implies in particular that no derivative information is available.The reason for describing these problems as expensive is that it may take a long time to calculate a single function value. The black box could, for example, solve a large system of differential equations or carrying out a heavy simulation, which can take anywhere from several minutes to several hours!These very special conditions therefore requires customized algorithms. Common optimization algorithms are based on calculating function values every now and then, which usually can be done instantly. But with an expensive problem, it may take several hours to compute a single function value. Our main objective is therefore to create algorithms that exploit all available information to the limit before a new function value is calculated. Or in other words, we want to find the optimal solution using as few function evaluations as possible.A good example of real life applications comes from the automotive industry, where on the development of new engines utilize advanced models that are governed by a dozen key parameters. The goal is to optimize the model by changing the parameters in such a way that the engine becomes as energy efficient as possible, but still meets all sorts of demands on strength and external constraints.

Place, publisher, year, edition, pages
Västerås: Mälardalens högskola, 2009
Series
Mälardalen University Press Licentiate Theses, ISSN 1651-9256 ; 105
National Category
Computational Mathematics
Research subject
Mathematics/Applied Mathematics
Identifiers
urn:nbn:se:mdh:diva-5970 (URN)978-91-86135-29-4 (ISBN)
Presentation
2009-09-03, Gamma, Hus U, Högskoleplan 1, Mälardalens Högskola, Västerås, 13:15 (English)
Opponent
Supervisors
Available from: 2009-05-26 Created: 2009-05-26 Last updated: 2009-08-20Bibliographically approved

Open Access in DiVA

No full text in DiVA

Search in DiVA

By author/editor
Holmström, Kenneth
By organisation
Department of Mathematics and PhysicsSchool of Education, Culture and Communication
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 165 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf