Solving a class of multiplicative programming problems via c-programming

In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques.     

Hyers–Ulam stability of linear differential operator with constant coefficients

Let P(z) be a polynomial of degree n with complex coefficients and consider the n–th order linear differential operator P(D). We show that the equation P(D)f = 0 has the Hyers–Ulam stability, if and only if the equation P(z) = 0 has no pure imaginary solution. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The regularizing properties of anisotropic radial basis functions

In the present work we consider the problem of interpolating scattered data using radial basis functions (RBF). In general, it is well known that this leads to a discrete linear inverse problem that needs to be regularized in order to provide a meaningful solution. The work focuses on a metric-regularization approach, based on a new class of RBF, called anisotropic RBF. The work provides theoretical justifications for the regularization approach and it considers a suitable proposal for the metric, supporting it by numerical examples.     

Sufficient optimality conditions and duality in vector optimization with invex-convexlike functions

We prove the Kuhn-Tucker sufficient optimality condition, the Wolfe duality, and a modified Mond-Weir duality for vector optimization problems involving various types of invex-convexlike functions. The class of such functins contains many known generalized convex functions. As applications, we demonstrate that, under invex-convexlikeness assumptions, the Pontryagin maximum principle is a sufficient optimality condition for cooperative differential games. The Wolfe duality is established for these games.The author is indebted to the referees and Professor W. Stadler for valuable remarks and comments, which have been used to revise considerably the paper.     

A numerically stable algorithm for two server queue models

In this paper, we consider a queueing system in which there are two exponential servers, each having his own queue, and arriving customers will join the shorter queue. Based on the results given in Flatto and McKean, we rewrite the formula for the probability that there are exactlyk customers in each queue, wherek = 0, 1,…. This enables us to present an algorithm for computing these probabilities and then to find the joint distribution of the queue lengths in the system. A program and numerical examples are given.     

Tangent cones and Dini derivatives

We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.     

Hypersurface with Constant Main Curvature Symmetric Functions

ＨｙｐｅｒｓｕｒｆａｃｅｗｉｔｈＣｏｎｓｔａｎｔＭａｉｎＣｕｒｖａｔｕｒｅＳｙｍｍｅｔｒｉｃＦｕｎｃｔｉｏｎｓ￥ＷｕＢａｏｑｉａｎｇ；ＳｏｎｇＨｏｎｇｚａｏ（ＸｕｚｈｏｕＴｅａｃｈｅｒｓＣｏｌｌｅｇｅ，２２１００９）（ＨｅｎａｎＵｎｉｖｅｒｓｉｔｙ，...     

Some remarks on the Jensen-Hadamard inequalities and applications

We provide some inequalities and integral inequalities connected to the Jensen-Hadamard inequalities for convex functions. In particular, we give some refinements to these inequalities. Some natural applications and further extensions are given.

---

Sunto Forniamo alcune diseguaglianze e diseguaglianze integrali connesse alle dise-gueglianze di Jensen-Hadamard per funzioni convesse. In particolare, diamo qualche miglioramento di queste diseguaglianze. Alcune applicazioni naturali ed ulteriori estensioni sono date.

     

A closed-form representation of mixed-integer program value functions

We identify a class of formulas computable in polynomial time such that the functions defined by these formulas are precisely the value functions of mixed-integer programs with rational constraint coefficients.     

Cell transfer and monomial positivity

We give combinatorial proofs that certain families of differences of products of Schur functions are monomial-positive. We show in addition that such monomial-positivity is to be expected of a large class of generating functions with combinatorial definitions similar to Schur functions. These generating functions are defined on posets with labelled Hasse diagrams and include for example generating functions of Stanley's (P,ω)-partitions. T.L. was supported in part by NSF DMS-0600677.