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等人的结果。     

Effective-field theory and the nuclear many-body problem

We review many-body calculations of the equation of state of dilute neutron matter in the context of effective-field theories of the nucleon-nucleon interaction.     

A new formula for the saddle-to-scission time

We propose a new formula for the saddle-to-scission time that is more general that the one based on Kramers' approach. Its validity and applicability is then studied in detail. Such a formula is useful for the evaluation of the fission time of very heavy nuclei.     

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.     

凸域内弦的平均长度

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