A Stochastic Subgradient Method for Distributionally Robust Non-convex and Non-smooth Learning

Journal of Optimization Theory and Applications - We consider a distributionally robust formulation of stochastic optimization problems arising in statistical learning, where robustness is with...     

IFS attractors and Cantor sets

We build a metric space which is homeomorphic to a Cantor set but cannot be realized as the attractor of an iterated function system. We give also an example of a Cantor set K in R³ such that every homeomorphism f of R³ which preserves K coincides with the identity on K.     

Size complementarity in anion recognition by neutral macrocyclic tetraamides

Comparison of the anion binding properties of a series of uncharged macrocyclic tetraamides reveal significant effects of the receptor's size on the strength of its anion complexes. This study allowed for estimation of the optimal size of a macroring for complexation of common anions.     

Galerkin method for optimal control of second‐order evolution equations

This paper presents the Galerkin approximation of the optimization problem of a system governed by non‐linear second‐order evolution equation where a non‐linear operator depends on derivative of the state of the system. The control is acting on a non‐linear equation. After giving some results on the existence of optimal control we shall prove the existence of the weak and strong condensation points of a set of solutions of the approximate optimization problems. Each of these points is a solution of the initial optimization problem. Finally we shall give a simple example using the obtained results. Copyright © 2004 John Wiley & Sons, Ltd.     

On testing the divisibility of lacunary polynomials by cyclotomic polynomials

An algorithm is described that determines whether a given polynomial with integer coefficients has a cyclotomic factor. The algorithm is intended to be used for sparse polynomials given as a sequence of coefficient-exponent pairs. A running analysis shows that, for a fixed number of nonzero terms, the algorithm runs in polynomial time.

     

Standardization of Methods for Characterizing the Surface Geometry of Solids

Since a comprehensive survey published in 1999 [1] much work was done in standardizing measuring methods to characterize the surface geometry of dispersed and/or porous solids and to certify reference materials. The present paper is an extension of a short communication [2]. It gives a survey on existing standards and reports on new drafts and proposals.     

The representation dimension of domestic weakly symmetric algebras

Auslander’s representation dimension measures how far a finite dimensional algebra is away from being of finite representation type. In [1], M. Auslander proved that a finite dimensional algebra A is of finite representation type if and only if the representation dimension of A is at most 2. Recently, R. Rouquier proved that there are finite dimensional algebras of an arbitrarily large finite representation dimension. One of the exciting open problems is to show that all finite dimensional algebras of tame representation type have representation dimension at most 3. We prove that this is true for all domestic weakly symmetric algebras over algebraically closed fields having simply connected Galois coverings.