几何凸函数与琴生型不等式

给出几何凸函数的定义以及判定几何凸函数的方法 ,建立关于几何凸函数的琴生型不等式 ,最后给出它的应用 ,包括改进一些已知不等式和建立一些新不等式 .     

Barycentric coordinates for convex sets

In this paper we provide an extension of barycentric coordinates from simplices to arbitrary convex sets. Barycentric coordinates over convex 2D polygons have found numerous applications in various fields as they allow smooth interpolation of data located on vertices. However, no explicit formulation valid for arbitrary convex polytopes has been proposed to extend this interpolation in higher dimensions. Moreover, there has been no attempt to extend these functions into the continuous domain, where barycentric coordinates are related to Green’s functions and construct functions that satisfy a boundary value problem. First, we review the properties and construction of barycentric coordinates in the discrete domain for convex polytopes. Next, we show how these concepts extend into the continuous domain to yield barycentric coordinates for continuous functions. We then provide a proof that our functions satisfy all the desirable properties of barycentric coordinates in arbitrary dimensions. Finally, we provide an example of constructing such barycentric functions over regions bounded by parametric curves and show how they can be used to perform freeform deformations.      

THE NBELC AND NWELC CLASSES OF LIFE DISTRIBUTIONS

ＴＨＥＮＢＥＬＣＡＮＤＮＷＥＬＣＣＬＡＳＳＥＳＯＦＬＩＦＥＤＩＳＴＲＩＢＵＴＩＯＮＳ￥ＣＡＯＪＩＮＨＵＡ；ＷＡＮＧＹＵＥＤＯＮＧ（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅ，Ｂｅｉｊｉｎ...     

A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM

ＡＢＲＡＮＣＨＢＯＵＮＤＭＥＴＨＯＤＦＯＲＳＵＢＳＥＴＳＵＭＰＲＯＢＬＥＭＷＵＳＨＩＱＵＡＮ（吴士泉）（ＩｎｓｔｉｔｕｔｅｏｆＡｐｐｌｉｅｄＭａｔｈｅｍａｔｉｃｓ，ｔｈｅＣｈｉｎｅｓｅＡｃａｄｅｍｙｏｆＳｃｉｅｎｃｅｓ，Ｂｅｉｊｉｎｇ１０００８０，Ｃ...     

Primal-dual proximal point algorithm for linearly constrained convex programming problems

A primal-dual version of the proximal point algorithm is developed for linearly constrained convex programming problems. The algorithm is an iterative method to find a saddle point of the Lagrangian of the problem. At each iteration of the algorithm, we compute an approximate saddle point of the Lagrangian function augmented by quadratic proximal terms of both primal and dual variables. Specifically, we first minimize the function with respect to the primal variables and then approximately maximize the resulting function of the dual variables. The merit of this approach exists in the fact that the latter function is differentiable and the maximization of this function is subject to no constraints. We discuss convergence properties of the algorithm and report some numerical results for network flow problems with separable quadratic costs.     

Exchange环的K0群的正向凸子群格

本文证明了：(1)Exchange环R的K0群的正向凸子群格同构于R的稳定余有限半本原理想格；(2)稳定有限、半本原的exchange环R是单的当且仅当它是K0-单的并且满足逼近弱s^*—可比性，推广了Goodearl，Ara等人的结果。     

Duality theorems for convex problems with time delay

In this paper, we examine a class of convex problems of Bolza type, involving a time delay in the state. It encompasses a variety of time-delay problems arising in the calculus of variations and optimal control. A duality analysis is carried out which, among other things, leads to a characterization of minimizers in terms of the Euler-Lagrange inclusion. The results obtained improve in significant respects on what is achievable by techniques previously employed, based on elimination of the time delay by introduction of an infinite-dimensional state space or on the method of steps.     

Corrected mirror systems with double reflection

We propose objectives consisting of two mirrors with central holes for passage of a light beam. The optical layout ensures multiple reflection of rays from both mirrors. We consider several approaches to calculating the design parameters for which three and four aberrations do not occur. The objectives can be used in optical devices operating in the UV and IR regions of the spectrum. __________ Translated from Zhurnal Prikladnoi Spektroskopii, Vol. 74, No. 2, pp. 267–270, March–April, 2007.     

New variants of the generalized level method for minimization of convex nondifferentiable functions taking infinite values

New variants of the generalized level method for minimization of convex Lipschitz functions on a compact set with a nonempty interior are proposed. These variants include the well-known generalized and classical level methods. For the new variants, an estimate of the convergence rate is found, including the variants in which the auxiliary problems are solved approximately.     

On Basic Constraint Qualifications for Infinite System of Convex Inequalities in Banach Spaces

The BCQ and the Abadie CQ for infinite systems of convex inequalities in Banach spaces are characterized in terms of the upper semi-continuity of the convex cones generated by the subdifferentials of active convex functions. Some relationships with other constraint qualifications such as the CPLV and the Slate condition are also studied. Applications in best approximation theory are provided.