FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W4226041171> ?p ?o ?g. }

• W4226041171 endingPage "534" @default.
• W4226041171 startingPage "520" @default.
• W4226041171 abstract "Engineering design optimization often involves use of numerical simulations to assess the performance of candidate designs. The simulations for computing high-fidelity (HF) performance estimates, such as finite element analysis or computational fluid dynamics, are typically computationally expensive. In some cases, it may also be possible to run an alternate or cheaper version of the simulation (through, e.g., use of a coarse mesh) to yield a low-fidelity (LF) performance estimate. Multifidelity optimization refers to the class of methods that aim to manage LF and HF evaluations efficiently to optimize computationally expensive problems within a limited computing budget. Among the prominent existing multifidelity approaches, some of them depend on a sufficiently dense a priori sampling; while others use unidirectional information exchange from LF to HF; both of which lead to a possibility of spending evaluation budget on unpromising search regions. This article proposes an improved multifidelity approach using an iterative, two-stage scheme (MFITS). It uses the collective information from the previously evaluated designs to determine a sampling neighborhood for LF evaluations. These samples are, in turn, used for building a co-kriging surrogate model that is then searched globally to identify a good candidate for HF evaluation. By restricting the LF sampling neighborhood, the computational budget can be used more efficiently, as the search is focused on regions that have historically produced good quality solutions. Numerical experiments and benchmarking are conducted on two suites of test problems and two practical design optimization problems to demonstrate the efficacy of MFITS." @default.
• W4226041171 created "2022-05-05" @default.
• W4226041171 creator A5008247165 @default.
• W4226041171 creator A5061883146 @default.
• W4226041171 creator A5077555584 @default.
• W4226041171 date "2023-06-01" @default.
• W4226041171 modified "2023-09-30" @default.
• W4226041171 title "An Iterative Two-Stage Multifidelity Optimization Algorithm for Computationally Expensive Problems" @default.
• W4226041171 cites W1517548193 @default.
• W4226041171 cites W1595159159 @default.
• W4226041171 cites W1851848794 @default.
• W4226041171 cites W1926678456 @default.
• W4226041171 cites W1972978214 @default.
• W4226041171 cites W1973333099 @default.
• W4226041171 cites W1977046327 @default.
• W4226041171 cites W1982886636 @default.
• W4226041171 cites W1986827922 @default.
• W4226041171 cites W2037936106 @default.
• W4226041171 cites W2041992845 @default.
• W4226041171 cites W2045595701 @default.
• W4226041171 cites W2062873010 @default.
• W4226041171 cites W2098964861 @default.
• W4226041171 cites W2134312057 @default.
• W4226041171 cites W2149599177 @default.
• W4226041171 cites W2151554678 @default.
• W4226041171 cites W2346778841 @default.
• W4226041171 cites W2348881650 @default.
• W4226041171 cites W2397089707 @default.
• W4226041171 cites W2478899349 @default.
• W4226041171 cites W2763090371 @default.
• W4226041171 cites W2779984550 @default.
• W4226041171 cites W2811395263 @default.
• W4226041171 cites W2883821397 @default.
• W4226041171 cites W2900477816 @default.
• W4226041171 cites W2943240551 @default.
• W4226041171 cites W2996739384 @default.
• W4226041171 cites W3011065368 @default.
• W4226041171 cites W3039683962 @default.
• W4226041171 cites W3047451660 @default.
• W4226041171 cites W3103595226 @default.
• W4226041171 cites W3131512346 @default.
• W4226041171 cites W3134604425 @default.
• W4226041171 cites W4298882835 @default.
• W4226041171 doi "https://doi.org/10.1109/tevc.2022.3170970" @default.
• W4226041171 hasPublicationYear "2023" @default.
• W4226041171 type Work @default.
• W4226041171 citedByCount "1" @default.
• W4226041171 countsByYear W42260411712023 @default.
• W4226041171 crossrefType "journal-article" @default.
• W4226041171 hasAuthorship W4226041171A5008247165 @default.
• W4226041171 hasAuthorship W4226041171A5061883146 @default.
• W4226041171 hasAuthorship W4226041171A5077555584 @default.
• W4226041171 hasConcept C105795698 @default.
• W4226041171 hasConcept C106131492 @default.
• W4226041171 hasConcept C111472728 @default.
• W4226041171 hasConcept C11413529 @default.
• W4226041171 hasConcept C119857082 @default.
• W4226041171 hasConcept C126255220 @default.
• W4226041171 hasConcept C138885662 @default.
• W4226041171 hasConcept C140779682 @default.
• W4226041171 hasConcept C144133560 @default.
• W4226041171 hasConcept C162853370 @default.
• W4226041171 hasConcept C19499675 @default.
• W4226041171 hasConcept C2781395549 @default.
• W4226041171 hasConcept C31972630 @default.
• W4226041171 hasConcept C33923547 @default.
• W4226041171 hasConcept C41008148 @default.
• W4226041171 hasConcept C75553542 @default.
• W4226041171 hasConcept C81692654 @default.
• W4226041171 hasConcept C86251818 @default.
• W4226041171 hasConceptScore W4226041171C105795698 @default.
• W4226041171 hasConceptScore W4226041171C106131492 @default.
• W4226041171 hasConceptScore W4226041171C111472728 @default.
• W4226041171 hasConceptScore W4226041171C11413529 @default.
• W4226041171 hasConceptScore W4226041171C119857082 @default.
• W4226041171 hasConceptScore W4226041171C126255220 @default.
• W4226041171 hasConceptScore W4226041171C138885662 @default.
• W4226041171 hasConceptScore W4226041171C140779682 @default.
• W4226041171 hasConceptScore W4226041171C144133560 @default.
• W4226041171 hasConceptScore W4226041171C162853370 @default.
• W4226041171 hasConceptScore W4226041171C19499675 @default.
• W4226041171 hasConceptScore W4226041171C2781395549 @default.
• W4226041171 hasConceptScore W4226041171C31972630 @default.
• W4226041171 hasConceptScore W4226041171C33923547 @default.
• W4226041171 hasConceptScore W4226041171C41008148 @default.
• W4226041171 hasConceptScore W4226041171C75553542 @default.
• W4226041171 hasConceptScore W4226041171C81692654 @default.
• W4226041171 hasConceptScore W4226041171C86251818 @default.
• W4226041171 hasFunder F4320334704 @default.
• W4226041171 hasIssue "3" @default.
• W4226041171 hasLocation W42260411711 @default.
• W4226041171 hasOpenAccess W4226041171 @default.
• W4226041171 hasPrimaryLocation W42260411711 @default.
• W4226041171 hasRelatedWork W1995200351 @default.
• W4226041171 hasRelatedWork W2021236762 @default.
• W4226041171 hasRelatedWork W2050171646 @default.
• W4226041171 hasRelatedWork W2156411806 @default.
• W4226041171 hasRelatedWork W2291198487 @default.

• next