The stability radius of an efficient solution in minimax Boolean programming problem
The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian-Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. Involving...
Two conditions are given each of which is both necessary and sufficient for a point to be a global Pareto minimum. The first one is obtained by studying programs where each criterion appears as a single objective function, while the second one is given in terms of a "restricted Lagrangian". The conditions are compared with the familiar characterizations of properly efficient and weakly efficient points of Karlin and Geoffrion.
A general framework for calculating shape derivatives for optimization problems with partial differential equations as constraints is presented. The proposed technique allows to obtain the shape derivative of the cost without the necessity to involve the shape derivative of the state variable. In fact, the state variable is only required to be Lipschitz continuous with respect to the geometry perturbations. Applications to inverse interface problems, and shape optimization for elliptic systems...
In der vorliegenden Arbeit leiten wir ein hinreichendes Kriterium für lokale Optimalität bei allgemeinen quadratischen Optimierungsproblemen her. Wir verwenden dabei in Anlehnung an die lineare parametrische Optimierung gewisse Stabilitätsmengen, wie sie erstmals K. Lommatzsch verwendet hat.