Past

The modelling of the elastoplastic behaviour of single

crystals with infinite latent hardening leads to a nonconvex energy

density, whose minimization produces fine structures. The computation

of the quasiconvex envelope of the energy density involves the solution

of a global nonconvex optimization problem. Previous work based on a

brute-force global optimization algorithm faced huge numerical

difficulties due to the presence of clusters of local minima around the

global one. We present a different approach which exploits the structure

of the problem both to achieve a fundamental understanding on the

optimal microstructure and, in parallel, to design an efficient

numerical relaxation scheme.

This work has been carried out jointly with Carsten Carstensen

(Humboldt-Universitaet zu Berlin) and Sergio Conti (Universitaet

Duisburg-Essen)

Several formulations of structural optimization problems based on linear and nonlinear semidefinite programming will be presented. SDP allows us to formulate and solve problems with difficult constraints that could hardly be solved before. We will show that sometimes it is advantageous to prefer a nonlinear formulation to a linear one. All the presented formulations result in large-scale sparse (nonlinear) SDPs. In the second part of the talk we will show how these problems can be solved by our augmented Lagrangian code PENNON. Numerical examples will illustrate the talk.

Joint work with Michael Stingl.

We consider as a starting point a problem raised by Kunen and Tall as to whether

the real continuum can have non-homeomorphic versions in different submodels of

the universe of all sets. Its resolution depends on modest large cardinals.

In general Junqueira and Tall have made a study of such "substructure spaces"

where the topology of a subspace can be different from the usual relative

topology.