1996
DOI: 10.1080/12506559.1996.10511239
|View full text |Cite
|
Sign up to set email alerts
|

A quasi-Newton interior point algorithm applied to constrained optimum design in computational fluid dynamics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
10
0

Year Published

2003
2003
2011
2011

Publication Types

Select...
4
1

Relationship

3
2

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 4 publications
0
10
0
Order By: Relevance
“…It can be also further generalized by replacing in the Newton step the Hessian ~~ + L >' 1 ~~ by an adequate positive definite approximation B constructed I for example by a BFGS updating procedure. The general Herskovits algorithm [23,24] then updates the solution (z, >.) through the following steps: i) Newton's prediction Solve the linearized equations of optimality In practice, the above one-dimensional problem is usually solved by an Armijo technique computing the first element in the sequence {I, v, V 2 , V 3 , ..• } such that…”
Section: Herskovits' Algorithm Without Equality Constraintsmentioning
confidence: 99%
See 2 more Smart Citations
“…It can be also further generalized by replacing in the Newton step the Hessian ~~ + L >' 1 ~~ by an adequate positive definite approximation B constructed I for example by a BFGS updating procedure. The general Herskovits algorithm [23,24] then updates the solution (z, >.) through the following steps: i) Newton's prediction Solve the linearized equations of optimality In practice, the above one-dimensional problem is usually solved by an Armijo technique computing the first element in the sequence {I, v, V 2 , V 3 , ..• } such that…”
Section: Herskovits' Algorithm Without Equality Constraintsmentioning
confidence: 99%
“…Such a behavior is usually respected in practice. The detailed implementation of the above algorithm is described in [24).…”
Section: Herskovits' Algorithm Without Equality Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…In this paper we employ a SAND formulation for both approaches and solve the optimization problems employing the Feasible Arc Interior Point Algorithm, FAIPA, a line search interior-point algorithm for nonlinear optimization. See [32], [33], [42], [37], [6] for a general discussion of the SAND formulation, [5], [34], [12], [13] for some other issues and applications and [20], [34], [21] for details about FAIPA.…”
Section: Introductionmentioning
confidence: 99%
“…Herein, we have calculated exact derivatives for all the functions of the discretized model. For more details about FAIPA see [10,11,24].…”
Section: Numerical Examplesmentioning
confidence: 99%