On Constraint Qualifications in Nonsmooth Optimization

We introduce extensions of the Mangasarian-Fromovitz and Abadie constraint qualifications to nonsmooth optimization problems with feasibility given by means of lower-level sets. We do not assume directional differentiability, but only upper semicontinuity of the defining functions. By deriving and reviewing primal first-order optimality conditions for nonsmooth problems, we motivate the formulations of the constraint qualifications. Then, we study their interrelation, and we show how they are related to the Slater condition for nonsmooth convex problems, to nonsmooth reverse-convex problems, to the stability of parametric feasible set mappings, and to alternative theorems for the derivation of dual first-order optimality conditions.In the literature on general semi-infinite programming problems, a number of formally different extensions of the Mangasarian-Fromovitz constraint qualification have been introduced recently under different structural assumptions. We show that all these extensions are unified by the constraint qualification presented here.     

Upper Bounds of the Pursuer Control Based on a Linear-Quadratic Differential Game

Differential game formulations provide an adequate basis for a guidance law synthesis against highly maneuvering targets. This paper deals with a guidance law based on a linear-quadratic differential game formulation. This guidance law has many attractive properties: it is continuous, linear with respect to the state variables, and its gain coefficients can be precalculated offline. Nevertheless, due to the lack of hard control constraints in the formulation, the magnitude of the control can exceed the admissible level imposed by the nature of the problem. In this paper, the upper bound of the interceptor control is obtained depending on the system parameters and the penalty coefficients of the game performance index. It is shown that the interceptor can guarantee an arbitrarily small miss distance without exceeding the control constraints if it has sufficient maneuverability and if the penalty coefficients are chosen properly. By manipulating the penalty coefficients, it is possible to reduce significantly the maneuverability requirements compared to the case of zero interceptor penalty coefficient.     

The existence of Thom classes

In this paper we consider the category of unstable modules over the Steenrod algebra. We prove the existence of finite primary decompositions in this category. Moreover, we prove the existence of Thom classes in noetherian unstable modules, i.e., elements that generate cyclic unstable submodules that are closed under the action of the Steenrod algebra. This in turn leads to the proof of the prime filtration theorem in the category of noetherian unstable modules. As an application we present a proof of the Landweber-Stong conjecture (now a theorem by D. Bourguiba and S. Zarati) that does not make use of the classification of injectives.     

PSL2(59) is a Subgroup of the Monster

A computer construction of the Monster is used to prove thatPSL(2, 59) is a subgroup of the Monster.     

On division rings with algebraic commutators of bounded degree

We shall answer several questions concerning additive or multiplicative commutators in a division ring which are algebraic of bounded degree over its center.     

Identifying assembly maps in K- and L-theory

In this paper we prove the equivalence of various algebraically or geometrically defined assembly maps used in formulating the main conjectures in K- and L-theory, and C^*-theory.Partially supported by NSERC grant A4000 and NSF grant DMS 9104026. The authors also wish to thank the SFB für Geometrie und Analysis, Münster, and the Max Planck Institut für Mathematik, Bonn, for their hospitality and support.Received: 7 May 2001