Reduced quasi-Newton method for simultaneous design and optimization (Q548686)

From MaRDI portal
Revision as of 01:31, 14 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/coap/HamdiG11, #quickstatements; #temporary_batch_1731543907597)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reduced quasi-Newton method for simultaneous design and optimization
scientific article

    Statements

    Reduced quasi-Newton method for simultaneous design and optimization (English)
    0 references
    0 references
    0 references
    30 June 2011
    0 references
    The paper deals with a design optimization problem where the constraint is a state equation: (P) min \(f(y,u)\) s.t. \(c(y,u)=0\) where \(y\) denotes the state and \(u\) the design variable. It is assumed that the state \(c(y,u)=0\) can be transformed into a fixed point equation \(y=G(y,u)\). Then (P) is transformed into an equality constrained optimization problem of the form: (PG) min \(f(y,u)\) s.t. \(y=G(y,u)\). The authors use the Lagrangian of (PG) to append the primal iteration with the dual and preconditioned design iterations. The coordination of the three iterative process is guaranteed by using an exact penalty function of double augmented Lagrangian type. Under certain assumptions global convergence of the optimization approach is proved. Finally, some numerical experiments done on a variant of the Bratu problem are presented.
    0 references
    simultaneous analysis and design
    0 references
    preconditioning
    0 references
    augmented Lagrangian
    0 references
    exact penalty function
    0 references
    global convergence
    0 references

    Identifiers