On convex decompositions of a planar point set

Let P be a planar point set in general position. Neumann-Lara et al. showed that there is a convex decomposition of P with at most elements. In this paper, we improve this upper bound to .     

On optimizing certain nonlinear convex functions which are partially defined by a simulation process

This paper considers the problem of optimizing a nonlinear convex function which is, in part, defined by a simulation process. An iterative technique, based on contractive mapping properties, is given by which a selected class of such functions can be optimized.     

Global convergence of the partitioned BFGS algorithm for convex partially separable optimization

Global convergence is proved for a partitioned BFGS algorithm, when applied on a partially separable problem with a convex decomposition. This case convers a known practical optimization method for large dimensional unconstrained problems. Inexact solution of the linear system defining the search direction and variants of the steplength rule are also shown to be acceptable without affecting the global convergence properties.     

On the existence of efficient points

In this note we will study the existence ofefficient points of a set X with respect to a coneC by introducing the so-called quasi-C-bounded sets; relationships among C-compactness, C-boundedness and quasi-C-boundedness are studied in a systematic way, and new existence theorems are obtained which generalize some known results and which allow us to find existence conditions for vector optimization problem.     

Partial Orderings in the Category of Matrices over the Quaternion Field

ＰａｒｔｉａｌＯｒｄｅｒｉｎｇｓｉｎｔｈｅＣａｔｅｇｏｒｙｏｆＭａｔｒｉｃｅｓｏｖｅｒｔｈｅＱｕａｔｅｒｎｉｏｎＦｉｅｌｄＺｈｕａｎｇＷａｊｉｎ（庄瓦金）（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＺｈａｎｇＮｏｒｍａｌＣｏｌｌｅｇｅ，Ｆｕｊｉ...     

Minimizing the sum of a convex function and the product of two affine functions over a convex set

An efficient branch-and-bound algorithm for minimizing the sum of a convex function and the product of two affine functions over a convex set is proposed. The branching takes place in an interval of R the bounding is a relaxation     

On the existence of efficient points in locally convex spaces

We study the existence of efficient points in a locally convex space ordered by a convex cone. New conditions are imposed on the ordering cone such that for a set which is closed and bounded in the usual sense or with respect to the cone, the set of efficient points is nonempty and the domination property holds.     

On the existence of Fagnano trajectories in convex polygonal billiards

We prove that an n-gon is pedal strong Fagnano trajectory in some convex polygonal billiard table if and only if it is a convex Poncelet n-gon.      

On the structure of convex piecewise quadratic functions

Convex piecewise quadratic functions (CPQF) play an important role in mathematical programming, and yet their structure has not been fully studied. In this paper, these functions are categorized into difference-definite and difference-indefinite types. We show that, for either type, the expressions of a CPQF on neighboring polyhedra in its domain can differ only by a quadratic function related to the common boundary of the polyhedra. Specifically, we prove that the monitoring function in extended linear-quadratic programming is difference-definite. We then study the case where the domain of the difference-definite CPQF is a union of boxes, which arises in many applications. We prove that any such function must be a sum of a convex quadratic function and a separable CPQF. Hence, their minimization problems can be reformulated as monotropic piecewise quadratic programs.This research was supported by Grant DDM-87-21709 of the National Science Foundation.     

On the convolution and subordination of convex functions

In this work we present some new results on convolution and subordination in geometric function theory. We prove that the class of convex functions of order α is closed under convolution with a prestarlike function of the same order. Using this, we prove that subordination under the convex function order α is preserved under convolution with a prestarlike function of the same order. Moreover, we find a subordinating factor sequence for the class of convex functions. The work deals with several ideas and techniques used in geometric function theory, contained in the book Convolutions in Geometric Function Theory by Ruscheweyh (1982).     

On the existence of symmetric chain decompositions in a quotient of the Boolean lattice

We highlight a question about binary necklaces, i.e., equivalence classes of binary strings under rotation. Is there a way to choose representatives of the n-bit necklaces so that the subposet of the Boolean lattice induced by those representatives has a symmetric chain decomposition? Alternatively, is the quotient of the Boolean lattice , under the action of the cyclic group Z_n, a symmetric chain order? The answer is known to be yes for all prime n and for composite n≤18, but otherwise the question appears to be open. In this note we describe how it suffices to focus on subposets induced by necklaces with periodic block codes, substantially reducing the size of the problem. We mention a motivating application: determining whether minimum-region rotationally symmetric independent families of n curves exist for all n.     

A bundle type approach to the unconstrained minimization of convex nonsmooth functions

A numerical method for the unconstrained minimization of a convex nonsmooth function of several variables is presented. It is closely related to the bundle type approach and to the conjugate subgradient method. A way is suggested to reduce the amount of information to be stored during the computational procedure. Global convergence of the method to the minimum is proved.     

On the behavior of the homogeneous self-dual model for conic convex optimization

There is a natural norm associated with a starting point of the homogeneous self-dual (HSD) embedding model for conic convex optimization. In this norm two measures of the HSD model's behavior are precisely controlled independent of the problem instance: (i) the sizes of ɛ-optimal solutions, and (ii) the maximum distance of ɛ-optimal solutions to the boundary of the cone of the HSD variables. This norm is also useful in developing a stopping-rule theory for HSD-based interior-point solvers such as SeDuMi. Under mild assumptions, we show that a standard stopping rule implicitly involves the sum of the sizes of the ɛ-optimal primal and dual solutions, as well as the size of the initial primal and dual infeasibility residuals. This theory suggests possible criteria for developing starting points for the homogeneous self-dual model that might improve the resulting solution time in practice. This research has been partially supported through the MIT-Singapore Alliance.     

On the structure of singular sets of convex functions

Whenf is a convex function ofR ^h, andk is an integer with 0<k, then the set ^k (f)=x:dim(f(x)k may be covered by countably many manifolds of dimensionh–k and classC ² except an _h–k negligible subset.The author is supported by INdAM     

On the approximation of convex functions by Bernstein-type operators

As a consequence of Jensen's inequality, centered operators of probabilistic type (also called Bernstein-type operators) approximate convex functions from above. Starting from this fact, we consider several pairs of classical operators and determine, in each case, which one is better to approximate convex functions. In almost all the discussed examples, the conclusion follows from a simple argument concerning composition of operators. However, when comparing Szász-Mirakyan operators with Bernstein operators over the positive semi-axis, the result is derived from the convex ordering of the involved probability distributions. Analogous results for non-centered operators are also considered.     

On the continuity of midpoint hull convex set-valued functions

Summary The concept of hull convexity (midpoint hull convexity) for set-valued functions in vector spaces is examined. This concept, introduced by A. V. Fiacco and J. Kyparisis (Journal of Optimization Theory and Applications,43 (1986), 95–126), is weaker than one of convexity (midpoint convexity).The main result is a sufficient condition for a midpoint hull convex set-valued function to be continuous. This theorem improves a result obtained by K. Nikodem (Bulletin of the Polish Academy of Sciences, Mathematics,34 (1986), 393–399).     

On the existence and shape of least energy solutions for some elliptic systems

We establish an existence result for strongly indefinite semilinear elliptic systems with Neumann boundary condition, and we study the limiting behavior of the positive solutions of the singularly perturbed problem.     

On the existence of positive solutions for a class of singular boundary value problems

In this paper, by the use of a fixed point theorem, many new necessary and sufficient conditions for the existence of positive solutions in C[0,1]∩C¹[0,1]∩C²(0,1) or C[0,1]∩C²(0,1) are presented for singular superlinear and sublinear second-order boundary value problems. Singularities at t=0, t=1 will be discussed.     

On the partial sums,Cesáro and de la Valleé Poussin means of convex and starlike functions of order 1/2

In this paper we study certain properties of partial sums, cesáro and de la valleé Poussin means of convex and starlike functions.