Sharp bounds for four bivariate means derived from the Schwab-Borchardt mean are obtained. The bounding quantities are either geometric or arithmetic convex combinations of two generating means. The four means discussed in this paper have been introduced and studied in [13]. Mathematics subject classification (2010): 26E60, 26D05, 26D07.

In this paper we evaluate the entanglement assisted classical capacity of a class of quantum channels with long-term memory, which are convex combinations of memoryless channels. The memory of such channels can be considered to be given by a Markov chain which is aperiodic but not irreducible. This class of channels was introduced in [7], where its product state capacity was evaluated.

A method based on graph theory is investigated for creating global parametrizations for surface triangulations for the purpose of smooth surface fitting. The parametrizations, which are planar triangulations, are the solutions of linear systems based on convex combinations. A particular parametrization, called shape-preserving, is found to lead to visually smooth surface approximations.

Bivariate means defined as the Schwab-Borchardt mean of two bivariate means are investigated. Explicit formulas for those means are obtained. It is demonstrated that they interpolate inequalities connecting the well known bivariate means. Optimal bounds for the means under discussion are also obtained. The bounding quantities are convex combinations of the generating means.

The genus Phlegmariurus Holubis recognised more widely than originally proposed and is circumscribed to include both Neotropic and Palaeotropic epiphytic and terrestrial species of Huperzioid Lycopodiaceae that have isotomous shoots, lack bulbils in their sporophyllous shoots and have spores with convex lateral margins and foveolate-fossulate sculpture restricted to their distal surfaces. New c...

The nonnegative matrix factorization is a widely used, flexible matrix decomposition, finding applications in biology, image and signal processing and information retrieval, among other areas. Here we present a related matrix factorization. A multi-objective optimization problem finds conical combinations of templates that approximate a given data matrix. The templates are chosen so that as far...

In this article, we deal with iterative methods for approximation of fixed points and their applications. We first discuss fixed point theorems for a nonexpansive mapping or a family of nonexpansive mappings. In particular, we state a fixed point theorem which answered affirmatively a problem posed during the Conference on Fixed Point Theory and Applications held at CIRM, Marseille-Luminy, 1989...

We consider a variant of the vehicle routing problems with time windows, where the objective includes the inconvenience cost modeled by a convex function on each node. We formulate this mixed integer convex program using a novel set partitioning formulation, by considering all combinations of routes and block structures over the routes. We apply a branch-and-price framework to solve this formul...

We introduce a novel approach to specify and edit volumes of interest (VOI for short) interactively. Enhancing the capabilities of standard systems we provide tools to edit the VOI by defining a not necessarily convex polyhedral bounding object. We suggest to use low-level editing interactions for moving, inserting and deleting vertices, edges and faces of the polyhedron. The low-level operatio...