The literature on sparse recovery often adopts the “norm” ( ) as the penalty to induce sparsity of the signal satisfying an underdetermined linear system. The performance of the corresponding minimization problem can be characterized by its null space constant. In spite of the NP-hardness of computing the constant, its properties can still help in illustrating the performance of minimization. I...

A new approach is proposed to deal with degrees of freedom shared by more than two subdomains in the context of a non-overlapping domain decomposition procedure for solving a system related to a nodal finite element method. The main feature of the method is to preserve the continuity requirements on the unknowns and the finite element equations at these degrees of freedom. We prove that the cor...

In this paper, we present a detailed investigation for the properties of a oneparametric class of SOC complementarity functions, which include the globally Lipschitz continuity, strong semismoothness, and the characterization of the B-subdifferential at a general point. Moreover, for the merit functions induced by them for the second-order cone complementarity problem (SOCCP), we provide a cond...

We define the concept of partiality to cope with partial availability of arguments and results of program steps. To this end, relation algebras are investigated for which, in addition to the identity , a specific type of an ordering E ⊇ is given in order to model increasing degrees of availability. It turns out that functions regulating non-strict transfer of partialities in processes are latti...

If science fiction is a genre, then attempts to think about the nature of science fiction will be affected by one’s understanding of what genres are. I shall examine two approaches to genre, one (genres as regions of conceptual space) dominant but inadequate, the other (genres as historical particulars) better, but only occasionally making itself seen. I shall then discuss several important, in...

It is shown that for 2 ≤ t ≤ n− 3, a strict t-SB(n, n− 1) design does not exist, but for n ≥ 3, a non-strict 2-SB(n, n−1) design exists. The concept of large sets for Steiner triple systems is extended to SB designs and examples of a large sets for SB designs are given.

It is shown that all extensions of S5 modal logic, both in the standard formalization and in the formalization with strict implication, as well as all varieties of monadic algebras have unitary unification.

The single-crossing assumption simplifies the analysis of screening models as local incentive compatibility becomes sufficient for global incentive compatibility. If single crossing is violated, global incentive compatibility constraints have to be taken into account. This paper studies monotone solutions in a screening model that allows a one-time violation of single crossing. The results show...

We consider an augmented Lagrangian algorithm for minimizing a convex quadratic function subject to linear inequality constraints. Linear optimization is an important particular instance of this problem. We show that, provided the augmentation parameter is large enough, the constraint value converges globally linearly to zero. This property is viewed as a consequence of the proximal interpretat...

We consider an augmented Lagrangian algorithm for minimizing a convex quadratic function subject to linear inequality constraints. Linear optimization is an important particular instance of this problem. We show that, provided the augmentation parameter is large enough, the constraint value converges globally linearly to zero. This property is viewed as a consequence of the proximal interpretat...