The random coding capacity of a vector Gaussian arbitrarily varying channel (VGAVC) is determined, along with a simple general method for computing this capacity. The VGAVC is a discrete-time memoryless vector channel with an input power constraint and additive Gaussian noise that is further corrupted by an additive “jamming signal.” The statistics of this jamming signal are unknown and may be ...

We present a general method, based on conjugate duality, for solving a convex minimization problem without assuming unnecessary topological restrictions on the constraint set. It leads to dual equalities and characterizations of the minimizers without constraint qualification. As an example of application, the Monge-Kantorovich optimal transport problem is solved in great detail. In particular,...

This paper investigates the discrete-time per-sample model of the zero-dispersion optical fiber. It is shown that the capacityachieving input distribution is unique, has (continuous) uniform phase and discrete amplitude with a finite number of mass points. The optimality of this multi-ring input holds when the channel is subject to general input cost constraints that include peak power constrai...

Judice and Pires developed in recent years principal pivoting methods for the solving of the so-called box linear complementarity problems (BLCPs) where the constraint matrices are restrictedly supposed to be of P–matrices. This paper aims at presenting a new principal pivoting scheme for BLCPs where the constraint matrices are loosely supposed to be row sufficient. This scheme can be applied t...

We consider the utility maximization problem for an investor who faces a solvency or risk constraint in addition to a budget constraint. The investor wishes to maximize her expected utility from terminal wealth subject to a bound on her expected solvency at maturity. We measure solvency using a solvency function applied to the terminal wealth. The motivation for our analysis is an optimal inves...

We study the behavior of thin elastic sheets that are bent and strained under a weak, smooth confinement. We show that the emerging shapes exhibit the coexistence of two types of domains. A focused-stress patch is subject to a geometric, piecewise-inextensibility constraint, whereas a diffuse-stress region is characterized by a mechanical constraint-the dominance of a single component of the st...

We describe an infeasible-interior-pointalgorithmfor monotone variational inequality problems and prove that it converges globally and superlinearly under standard conditions plus a constant rank constraint quali cation. The latter condition represents a relaxation of the two types of assumptions made in existing superlinear analyses; namely, linearity of the constraints and linear independence...

Model-driven development is one approach to combating the complexity of designing software intensive systems. A model-driven approach allows designers to use domain notations to specify solutions and domain constraints to ensure that the proposed solutions meet the required objectives. Many domains, however, require models that are either so large or intricately constrained that it is extremely...

Creating a perceptually distinct coloring for visualizing large data sets with one or more related properties can be difficult, even for a domain expert. To aid in the color selection process, we present a method for selecting an optimized coloring for these data sets by applying a force-directed algorithm. The method we have implemented selects hue values using a constraint graph derived from ...