## 90C48 Programming in abstract spaces

### Refine

#### Document Type

- Preprint (2)

#### Language

- English (2)

#### Has Fulltext

- yes (2)

#### Is part of the Bibliography

- no (2)

#### Keywords

- Optimal semiconductor design (1)
- Vetor optimization (1)
- adjoints (1)
- aggressive space mapping (1)
- convex operator (1)
- decrease direction (1)
- descent algorithm (1)
- directional derivative (1)
- drift diffusion (1)
- energy transport (1)

#### Faculty / Organisational entity

We consider optimal design problems for semiconductor devices which are simulated using the energy transport model. We develop a descent algorithm based on the adjoint calculus and present numerical results for a ballistic diode. Further, we compare the optimal doping profile with results computed on basis of the drift diffusion model. Finally, we exploit the model hierarchy and test the space mapping approach, especially the aggressive space mapping algorithm, for the design problem. This yields a significant reduction of numerical costs and programming effort.

Convex Operators in Vector Optimization: Directional Derivatives and the Cone of Decrease Directions
(1999)

The paper is devoted to the investigation of directional derivatives and the cone of decrease directions for convex operators on Banach spaces. We prove a condition for the existence of directional derivatives which does not assume regularity of the ordering cone K. This result is then used to prove that for continuous convex operators the cone of decrease directions can be represented in terms of the directional derivatices . Decrease directions are those for which the directional derivative lies in the negative interior of the ordering cone K. Finally, we show that the continuity of the convex operator can be replaced by its K-boundedness.