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

### From inside the book

Results 1-3 of 9

Page xi

Description of the

Appendix V. On the differentiability of a projection on a convex set in Hilbert

space 302 AV.l. The basic results 302 AV.2. Application to variational inequalities

, XI.

Description of the

**sequential quadratic programming**(SQP) algorithm 300Appendix V. On the differentiability of a projection on a convex set in Hilbert

space 302 AV.l. The basic results 302 AV.2. Application to variational inequalities

, XI.

Page 318

Gill, P.E., Murray, W., Saunders, M.A. and Wright, M.H. (1984),

Analysis and Optimization of Mechanical System Dynamics," (ed. Edward J.

Haug) ...

Gill, P.E., Murray, W., Saunders, M.A. and Wright, M.H. (1984),

**Sequential****quadratic programming**methods for nonlinear programming, in "Computer AidedAnalysis and Optimization of Mechanical System Dynamics," (ed. Edward J.

Haug) ...

Page 334

... 175 saddle-point approach 14, 175 scalar product 9 seminorm 8-9 sensitivity

analysis 79-80, 114-119, 124-128, 154-155, 170-180, 210-215, 235-245, 254-

255, 271-287

shapes ...

... 175 saddle-point approach 14, 175 scalar product 9 seminorm 8-9 sensitivity

analysis 79-80, 114-119, 124-128, 154-155, 170-180, 210-215, 235-245, 254-

255, 271-287

**sequential quadratic programming**300-301 set of admissibleshapes ...

### 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