2017
DOI: 10.1007/s10898-017-0496-y
|View full text |Cite
|
Sign up to set email alerts
|

GOSAC: global optimization with surrogate approximation of constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 34 publications
(21 citation statements)
references
References 35 publications
0
21
0
Order By: Relevance
“…Müller and Woodbury (2017) develop a method for addressing computationally inexpensive objectives while satisfying computationally expensive constraints. Their two-phase method first seeks feasibility by solving a multi-objective optimization problem (a problem class that is the subject of Section 8.4) in which the constraint violations are minimized simultaneously; the second phase seeks to reduce the objective subject to constraints derived from cubic RBF models of the constraint functions.…”
Section: Methods For Constrained Optimizationmentioning
confidence: 99%
See 1 more Smart Citation
“…Müller and Woodbury (2017) develop a method for addressing computationally inexpensive objectives while satisfying computationally expensive constraints. Their two-phase method first seeks feasibility by solving a multi-objective optimization problem (a problem class that is the subject of Section 8.4) in which the constraint violations are minimized simultaneously; the second phase seeks to reduce the objective subject to constraints derived from cubic RBF models of the constraint functions.…”
Section: Methods For Constrained Optimizationmentioning
confidence: 99%
“…Tröltzsch [2016] uses linear models of the constraint functions and quadratic models of the objective function, with these models replacing c and f in the augmented Lagrangian merit function in (77). Step acceptance uses a merit function (an exact penalty function). Müller and Woodbury [2017] develop a method for addressing computationally inexpensive objectives while satisfying computationally expensive constraints. Their two-phase method first seeks feasibility by solving a multi-objective optimization problem (a problem class that is the subject of Section 8.4) in which the constraint violations are minimized simultaneously; the second phase seeks to reduce the objective subject to constraints derived from cubic RBF models of the constraint functions.…”
Section: Simulation-based Constraintsmentioning
confidence: 99%
“…Durantin et al (2016) discusses a rocket motor design. Müller and Woodbury (2017) discusses the agricultural management of a speci…c watershed to minimize the costs of reducing the phosphorus load to a given threshold by retiring agricultural lands with high nutrient runo¤. Chaiyotha and Krityakierne (2020) compares several EGO-based methods for solving a pressure vessel design optimization problem.…”
Section: Conclusion and Future Researchmentioning
confidence: 99%
“…Several more methods are discussed in Bagheri et al (2017b), Cheng et al (2018), Durantin et al (2016), Dzahini et al (2020), Habib et al (2016), Friese et al (2020), Haftka et al (2016), Müller and Woodbury (2017), Parnianifard, et al (2020), Passos et al (2019), Lee (2021), Su et al (2020), and Ungredda and Branke (2021).…”
Section: Conclusion and Future Researchmentioning
confidence: 99%
“…Interpolation approximation models such as radial basis functions (RBFs; Powell, ) have been used in many optimization algorithms (Müller et al, ; Regis & Shoemaker, , ) and applied to a variety of science problems, for example, watershed management (Müller & Woodbury, ), methane transport in the community land model (Müller et al, ), and the multiobjective design of airfoils (Müller, ). Closely related to using surrogate models for optimization purposes are Gaussian process emulation approaches that have been used to quantify the uncertainty of microphysical parameters (Johnson et al, ; Lee et al, ).…”
Section: Introductionmentioning
confidence: 99%