## Finite element approximation for optimal shape design: theory and applications |

### From inside the book

Results 1-3 of 17

Page 262

The asymptotic relation between solutions for discretized optimal shape

problems and continuous ones has not been very widely studied until now. For

the application of mapping methods see Begis and Glowinski (1975) and

The asymptotic relation between solutions for discretized optimal shape

problems and continuous ones has not been very widely studied until now. For

the application of mapping methods see Begis and Glowinski (1975) and

**Hlavacek**and ...Page 320

Hearn, A.C. (1983), "REDUCE user's manual," Version 3.0, The Rand Corp.,

Santa Monica, California. Hemp, W.S. (1973), "Optimum Structures," Clarendon,

Oxford.

Mat ...

Hearn, A.C. (1983), "REDUCE user's manual," Version 3.0, The Rand Corp.,

Santa Monica, California. Hemp, W.S. (1973), "Optimum Structures," Clarendon,

Oxford.

**Hlavacek**, I. (1983), Optimization of the shape of axisymmetric shells, Apl.Mat ...

Page 321

stress of a beam. Part III. Optimal design of an elastic plate, Appl. Math. Optim. 13,

117-136.

...

**Hlavacek**, I., Bock, I. and Lovfsek, J. (1985), Part II. Local Optimization of thestress of a beam. Part III. Optimal design of an elastic plate, Appl. Math. Optim. 13,

117-136.

**Hlavacek**, I., Haslinger, J., Necas, J. and Lovfsek, J. (1988), "Numerical...

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

Preliminaries | 1 |

Abstract setting of optimal shape design problem and | 28 |

Optimal shape design of systems governed by a unilateral | 53 |

Copyright | |

10 other sections not shown

### Other editions - View all

### Common terms and phrases

adjoint algorithm Appendix applied approximation boundary conditions boundary value problem Chapter constraints contact problems convergence convex set cost functional defined denote design sensitivity analysis differentiable discrete domain elastic exist a subsequence fi(a Figure finite element fixed follows formula ft(a G K(a G R2 G U&d G V(a given gradient Green's formula Haslinger Haug Hilbert space Hlavacek initial iterations Komkov Lagrange multipliers least one solution Lemma liminf limsup linear Lipschitz Lipschitz continuous lower semicontinuous mapping material derivative method minimize Moreover Necas Neittaanmaki nodal nodes nonlinear programming nonsmooth Numerical results obtain optimal control optimal pair optimal shape design parameter Pironneau Proof prove respect results for Example satisfying sequence sequential quadratic programming shape design problems shape optimization Sokolowski solves P(a stresses subgradient sufficiently small Tc(a Theorem triangulation variational inequality vector Zolesio