1998
DOI: 10.1007/bf01203525
|View full text |Cite
|
Sign up to set email alerts
|

Convergence of trust region augmented Lagrangian methods using variable fidelity approximation data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
64
0

Year Published

2001
2001
2013
2013

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 109 publications
(64 citation statements)
references
References 33 publications
0
64
0
Order By: Relevance
“…One of the most common methods to enforce a constraint is to add a penalization term inside the cost function whose magnitude is adjusted dynamically until the constraint is satisfied. In this respect, a very popular method is the augmented-Lagrangian method [74]. Another more empirical technique consists instead in recovering the constraint a posteriori, i.e.…”
Section: Parameters Constraintsmentioning
confidence: 99%
“…One of the most common methods to enforce a constraint is to add a penalization term inside the cost function whose magnitude is adjusted dynamically until the constraint is satisfied. In this respect, a very popular method is the augmented-Lagrangian method [74]. Another more empirical technique consists instead in recovering the constraint a posteriori, i.e.…”
Section: Parameters Constraintsmentioning
confidence: 99%
“…Initial approaches to nonlinearly-constrained SBO optimized an approximate merit function which incorporated the nonlinear constraints [70,4]:…”
Section: Surrogate-based Local Minimizationmentioning
confidence: 99%
“…Step 7 Convergence Test: The convergence of the entire framework is governed by satisfying the KarushKuhn-Tucker conditions as is done by Rodríguez et al 30 and Conn et al . 31 For the implementation used in this research the convergence was determined by the following two inequalities:…”
Section: Variable Fidelity Optimizationmentioning
confidence: 99%
“…Furthermore, for each scaling the first order and quasi-second order methods using BFGS and SR1 were compared. All of the trials were started at the point x = [40,30] T with an initial trust region size of ∆ 0 = 10. The results are summarized in Table 2.…”
Section: A Analytic Two Dimensional Problemmentioning
confidence: 99%