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.     

Lagrangian Duality in Set-Valued Optimization

In this paper, we study optimization problems where the objective function and the binding constraints are set-valued maps and the solutions are defined by means of set-relations among all the images sets (Kuroiwa, D. in Takahashi, W., Tanaka, T. (eds.) Nonlinear analysis and convex analysis, pp. 221–228, 1999). We introduce a new dual problem, establish some duality theorems and obtain a Lagrangian multiplier rule of nonlinear type under convexity assumptions. A necessary condition and a sufficient condition for the existence of saddle points are given. The authors thank the two referees for valuable comments and suggestions on early versions of the paper. The research of the first author was partially supported by Ministerio de Educación y Ciencia (Spain) Project MTM2006-02629 and by Junta de Castilla y León (Spain) Project VA027B06.     

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.     

Territories,corridors, and networks: A biological model for the premodern state

When depicted on maps as homogenous territorial wholes, ancient states are visually summarized as static entities in a way that conceals the highly fluid dynamics of polity formation, maintenance, and growth. Models derived from studies of animal behavior show that “territory” does not consist of an undifferentiated use of the landscape. Instead, the concept of territory can be parsed into a series of resource‐rich nodes linked by corridors of access, surrounded by unutilized regions and boundaries marked at points of competition. Ancient human groups also can be analyzed as having perceived and occupied landscapes through strategies of flexible networks in which nodes and corridors were surrounded by unutilized spaces around which boundaries were selectively identified and defended. This strategy is identifiable in human social groups at different levels of complexity ranging from hunter‐gatherers through ancient chiefdoms and states. © 2007 Wiley Periodicals, Inc. Complexity 12: 28–35, 2007     

凸域内弦的平均长度

本文研究了凸域内弦的平均长度.通过广义支持函数与凸域的弦幂积分,建立了凸域内弦的平均长度的一般公式,并用此公式得出了圆域和矩形域内弦的平均长度.