where (a) because that E and Tr are both linear operators and Tr[E[ZZ ]] is certain positive number which is independent on the optimization variables, then this term can be replaced by another positive constant Tr[EZ[Z ]EZ[Z]]. Based on the equivalence between (13) and (14), we can apply the result shown in [28, Lemma 2]. Since the constraint set is polyhedral in the formulation (3), the linea...

The application of test automation tools in a safety-critical context requires so-called tool qualification according to the applicable standards. The objective of this qualification is to justify that verification steps automated by the tool will not lead to faulty systems under test to be accepted as fit for purpose. In this paper we review the tool qualification requirements of the standards...

The application of test automation tools in a safety-critical context requires so-called tool qualification according to the applicable standards. The objective of this qualification is to justify that verification steps automated by the tool will not lead to faulty systems under test to be accepted as fit for purpose. In this paper we review the tool qualification requirements of the standards...

Though nursing education and training have been widely studied, how to encourage nursing staff to supervise nursing students receives relatively less attention. We aim to partially fill this gap by investigating factors affecting nursing staff’s willingness to supervise nursing students. Eleven factors on general qualification merits and seven factors on teaching merits and preferences are cons...

We study the conjugate of the maximum, f ∨ g, of f and g when f and g are proper convex lower semicontinuous functions on a Banach space E. We show that (f ∨g)∗∗ = f∗∗ ∨g∗∗ on the bidual, E∗∗, of E provided that f and g satisfy the Attouch-Brézis constraint qualification, and we also derive formulae for (f ∨ g)∗ and for the “preconjugate” of f∗ ∨ g∗.

The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximal monotone operators provided that Rockafellar’s constraint qualification holds. In this paper, we prove the maximal monotonicity of A+B provided that A and B are maximal monotone operators such that domA ∩ int domB ̸= ∅, A+NdomB is of type (FPV), and domA∩domB ⊆ domB. The proof ...