Polynomial approximation, local polynomial convexity, and degenerate CR singularities

We begin with the following question: given a closed disc and a complex-valued function , is the uniform algebra on generated by z and F equal to ? When F∈C¹(D), this question is complicated by the presence of points in the surface that have complex tangents. Such points are called CR singularities. Let p∈S be a CR singularity at which the order of contact of the tangent plane with S is greater than 2; i.e. a degenerate CR singularity. We provide sufficient conditions for S to be locally polynomially convex at the degenerate singularity p. This is useful because it is essential to know whether S is locally polynomially convex at a CR singularity in order to answer the initial question. To this end, we also present a general theorem on the uniform algebra generated by z and F, which we use in our investigations. This result may be of independent interest because it is applicable even to non-smooth, complex-valued F.     

The Bergman metric and the pluricomplex Green function

We improve a lower bound for the Bergman distance in smooth pseudoconvex domains due to Diederich and Ohsawa. As the main tool we use the pluricomplex Green function and an -estimate for the -operator of Donnelly and Fefferman.

     

The polynomial hull of a set of finite linear measure in Cn

Journal d'Analyse Mathématique -     

Ersatz function method for minimizing a finite-valued function on a compact set

A method is proposed for solving optimization problems with continuous variables and a function taking a large finite set of values. Problems of this type arise in the multicriteria construction of a control rule for a discrete-time dynamical system whose performance criteria coincide with the number of violations of requirements imposed on the system. The rule depends on a finite set of parameters whose set of admissible values defines a collection of admissible control rules. An example is the problem of choosing a control rule for a cascade of reservoirs. The optimization method is based on solving a modified problem in which the original function is replaced by a continuous ersatz function. A theorem on the relation between the average-minimal values of the original and ersatz functions is proved. Optimization problems are solved with power-law ersatz functions, and the influence exerted by the exponent on the quality of the solution is determined. It is experimentally shown that the solutions produced by the method are of fairly high quality.     

Relations between the convexity of a set and the differentiability of its support function

It is known that, in finite dimensions, the support function of a compact convex set with nonempty interior is differentiable excepting the origin if and only if the set is strictly convex. In this paper, we realize a thorough study of the relations between the differentiability of the support function on the interior of its domain and the convexity of the set, mainly for unbounded sets. Then, we revisit some results related to the differentiability of the cost function associated to a production function.     

The linking set problem: a polynomial special case of the multiple-choice knapsack problem

We consider the linking set problem, which can be seen as a particular case of the multiple-choice knapsack problem. This problem occurs as a subproblem in a decomposition procedure for solving large-scale p-median problems such as the optimal diversity management problem. We show that if a non-increasing diference property of the costs in the linking set problem holds, then the problem can be solved by a greedy algorithm and the corresponding linear gap is null.     

The convexity of the reachable set for a bilinear controllable system

The reachable of a bilinear controllable system, in which the range of allowed control values is a convex polyhedron, is examined. Sufficient conditions of convexity of the reachable set, which enable the maximum principle to be used in the standard form are found.     

On the core,the Weber set and convexity in games with a priori unions

This paper deals with the concepts of core and Weber set with a priori unions à la Owen. As far as we know, the Owen approach to games with a priori unions has never been studied from the coalitional stability point of view. Thus we introduce the coalitional core and coalitional Weber set and characterize the class of convex games with a priori unions by means of the relationships between both solution concepts.     

Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set

A numerical algorithm for minimizing a convex function on the set-theoretic intersection of a spherical surface and a convex compact set is proposed. The idea behind the algorithm is to reduce the original minimization problem to a sequence of convex programming problems. Necessary extremum conditions are examined, and the convergence of the algorithm is analyzed.     

Algorithms for projecting a point onto a level surface of a continuous function on a compact set

Given an equation f(x) = 0, the problem of finding its solution nearest to a given point is considered. In contrast to the authors’ previous works dealing with this problem, exact algorithms are proposed assuming that the function f is continuous on a compact set. The convergence of the algorithms is proved, and their performance is illustrated with test examples.     

A special ordered set approach for optimizing a discontinuous separable piecewise linear function

We give a special ordered set (SOS) approach that optimizes a discontinuous separable piecewise linear function, even when a mixed-integer programming (MIP) model is not available for it. When a MIP model is available, our SOS model gives a linear programming relaxation bound that is as good as the MIPs.     

The highest smoothness of the Green function implies the highest density of a set

We investigate local properties of the Green function of the complement of a compact setEυ[0,1] with respect to the extended complex plane. We demonstrate, that if the Green function satisfies the 1/2-Hölder condition locally at the origin, then the density ofE at 0, in terms of logarithmic capacity, is the same as that of the whole interval [0, 1]..     

On the radii of convexity and starlikeness for some special classes of analytic functions in a disk

We introduce the class O _α, 0≤α≤1, of functions w=?(z), ?(0)=0, ?′(0)=0,..., ? ₍₀₎ ^(n?1) =0, f ⁽ⁿ⁾(0)=(n-l)! analytic in the disk |z|<1 and satisfying the condition $$\operatorname{Re} \left( {\frac{{1 - 2z^n \cos \Theta + z^{2n} }}{{z^{n - 1} }}f'(z)} \right) > \alpha , 0 \leqslant \Theta \leqslant \pi , n = 1,2,3,... .$$ We establish the radius of convexity in the class Oα and the radius of starlikeness in the class Uα of functions σ(z)=z?′(z), ?(z)?O _α.