We give the weakest constraint qualification known to us that ensures the maximal monotonicity of the operator A∗ ◦ T ◦A when A is a linear continuous mapping between two reflexive Banach spaces and T is a maximal monotone operator. As a special case we get the weakest constraint qualification that ensures the maximal monotonicity of the sum of two maximal monotone operators on a reflexive Bana...

The expansion of Wireless Systems-on-Chip leads to a rapid development of design and manufacturing methods. In this paper, the test vectors used for design validation of AMS & RF SoCs are evaluated and optimized. This qualification is based on a fault injection method. A fault model based on variation of behavioral parameters and a related qualification metric are proposed. This approach is use...

We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...

Kyparisis proved in 1985 that a strict version of the MangasarianFromovitz constraint qualification (MFCQ) is equivalent to the uniqueness of Lagrange multipliers. However, the definition of this strict version of MFCQ requires the existence of a Lagrange multiplier and is not a constraint qualification (CQ) itself. In this note we show that LICQ is the weakest CQ which ensures (existence and) ...

Given the increasing role of mobile computing and mobile information access, knowledge about these technologies is an important qualification for future computer scientists. Another important qualification is the ability to work as a team. In our lab course, we offer the opportunity to gain hands-on experience in both areas through the distributed, collaborative development of a mobile game. Th...