Completions for partially ordered semigroups

A standard completion γ assigns a closure system to each partially ordered set in such a way that the point closures are precisely the (order-theoretical) principal ideals. If S is a partially ordered semigroup such that all left and all right translations are γ-continuous (i.e., Y∈γS implies {x∈S:y·x∈Y}∈γS and {x∈S:x·y∈Y}∈γS for all y∈S), then S is called a γ-semigroup. If S is a γ-semigroup, then the completion γS is a complete residuated semigroup, and the canonical principal ideal embedding of S in γS is a semigroup homomorphism. We investigate the universal properties of γ-semigroup completions and find that under rather weak conditions on γ, the category of complete residuated semigroups is a reflective subcategory of the category of γ-semigroups. Our results apply, for example, to the Dedekind-MacNeille completion by cuts, but also to certain join-completions associated with so-called “subset systems”. Related facts are derived for conditional completions. A first draft of this paper by the second author, containing parts of Section 2, was received on August 9, 1985.     

An Application of the Bivariate Inf-Convolution Formula to Enlargements of Monotone Operators

Motivated by a classical result concerning the ε-subdifferential of the sum of two proper, convex and lower semicontinuous functions, we give in this paper a similar result for the enlargement of the sum of two maximal monotone operators defined on a Banach space. This is done by establishing a necessary and sufficient condition for a bivariate inf-convolution formula.     

Forward-Backward and Tseng’s Type Penalty Schemes for Monotone Inclusion Problems

We deal with monotone inclusion problems of the form 0 ∈ A x + D x + N _C (x) in real Hilbert spaces, where A is a maximally monotone operator, D a cocoercive operator and C the nonempty set of zeros of another cocoercive operator. We propose a forward-backward penalty algorithm for solving this problem which extends the one proposed by Attouch et al. (SIAM J. Optim. 21(4): 1251-1274, 2011). The condition which guarantees the weak ergodic convergence of the sequence of iterates generated by the proposed scheme is formulated by means of the Fitzpatrick function associated to the maximally monotone operator that describes the set C. In the second part we introduce a forward-backward-forward algorithm for monotone inclusion problems having the same structure, but this time by replacing the cocoercivity hypotheses with Lipschitz continuity conditions. The latter penalty type algorithm opens the gate to handle monotone inclusion problems with more complicated structures, for instance, involving compositions of maximally monotone operators with linear continuous ones.     

Usefulness of Transgenic Luminescent Bacteria in Direct Bioautographic Investigation of Chamomile Extracts

JPC – Journal of Planar Chromatography – Modern TLC - Direct bioautography performed with luminescence gene-tagged bacteria enables almost real-time detection of antimicrobial compounds...     

Tensor products and relation quantales

A classical tensor product \({A \otimes B}\) of complete lattices A and B, consisting of all down-sets in \({A \times B}\) that are join-closed in either coordinate, is isomorphic to the complete lattice Gal(A,B) of Galois maps from A to B, turning arbitrary joins into meets. We introduce more general kinds of tensor products for closure spaces and for posets. They have the expected universal property for bimorphisms (separately continuous maps or maps preserving restricted joins in the two components) into complete lattices. The appropriate ingredient for quantale constructions is here distributivity at the bottom, a generalization of pseudocomplementedness. We show that the truncated tensor product of a complete lattice B with itself becomes a quantale with the closure of the relation product as multiplication iff B is pseudocomplemented, and that the tensor product has a unit element iff B is atomistic. The pseudocomplemented complete lattices form a semicategory in which the hom-set between two objects is their tensor product. The largest subcategory of that semicategory has as objects the atomic boolean complete lattices, which is equivalent to the category of sets and relations. More general results are obtained for closure spaces and posets.     

Proximal-gradient algorithms for fractional programming

In this paper, we propose two proximal-gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either concave or convex. In the iterative schemes, we perform a proximal step with respect to the nonsmooth numerator and a gradient step with respect to the smooth denominator. The algorithm in case of a concave denominator has the particularity that it generates sequences which approach both the (global) optimal solutions set and the optimal objective value of the underlying fractional programming problem. In case of a convex denominator the numerical scheme approaches the set of critical points of the objective function, provided the latter satisfies the Kurdyka-?ojasiewicz property.     

On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems

We present two modified versions of the primal-dual splitting algorithm relying on forward–backward splitting proposed in V\(\tilde{\mathrm{u}}\) (Adv Comput Math 38(3):667–681, 2013) for solving monotone inclusion problems. Under strong monotonicity assumptions for some of the operators involved we obtain for the sequences of iterates that approach the solution orders of convergence of \(\mathcal{{O}}(\frac{1}{n})\) and \(\mathcal{{O}}(\omega ^n)\), for \(\omega \in (0,1)\), respectively. The investigated primal-dual algorithms are fully decomposable, in the sense that the operators are processed individually at each iteration. We also discuss the modified algorithms in the context of convex optimization problems and present numerical experiments in image processing and pattern recognition in cluster analysis.     

Corelationship between local structure and water purifying ability of iron-containing waste glasses

A relationship between the structure and water purifying ability of waste glass prepared from household garbage and Fe₂O₃ was examined by ⁵⁷Fe-Mössbauer and induced coupled plasma (ICP) measurements. From the Debye temperature of waste glass, Fe^II proved to be loosely bound in the glass network as a network modifier. Dissolution amount of Fe^III into artificial drain can be controlled from 0.14 to 0.35 mg/l by changing the Fe₂O₃ content. It proved that chemical oxygen demand (COD) decreases in proportion to the content of Fe^III, indicating that iron causes decomposition of organic and phosphorus compounds.