求解非线性互补问题的一个下降算法(英文)

在[1]中,Solodov将非线性互补问题等价地转化成一个带非负约束的优化问题.基于这种转化形式,我们给出了一种求解非线性互补问题的下降算法.在映射为强单调时,证明了算法的全局收敛性.     

Convex Separable Minimization Subject to Bounded Variables

A minimization problem with convex and separable objective function subject to a separable convex inequality constraint and bounded variables is considered. A necessary and sufficient condition is proved for a feasible solution to be an optimal solution to this problem. Convex minimization problems subject to linear equality/linear inequality constraint, and bounds on the variables are also considered. A necessary and sufficient condition and a sufficient condition, respectively, are proved for a feasible solution to be an optimal solution to these two problems. Algorithms of polynomial complexity for solving the three problems are suggested and their convergence is proved. Some important forms of convex functions and computational results are given in the Appendix.     

Global Optimality Conditions in Maximizing a Convex Quadratic Function under Convex Quadratic Constraints

For the problem of maximizing a convex quadratic function under convex quadratic constraints, we derive conditions characterizing a globally optimal solution. The method consists in exploiting the global optimality conditions, expressed in terms of -subdifferentials of convex functions and -normal directions, to convex sets. By specializing the problem of maximizing a convex function over a convex set, we find explicit conditions for optimality.     

A Distance-Regular Graph with Strongly Closed Subgraphs

Let be a distance-regular graph of diameter d, valency k and r := maxi | (c _i,b _i) = (c ₁,b ₁). Let q be an integer with r + 1 q d – 1.In this paper we prove the following results: Theorem 1 Suppose for any pair of vertices at distance q there exists a strongly closed subgraph of diameter q containing them. Then for any integer i with 1 i q and for any pair of vertices at distance i there exists a strongly closed subgraph of diameter i containing them. Theorem 2 If r 2, then c _2r+3 1.As a corollary of Theorem 2 we have d k ²(r + 1) if r 2.     

Global Convergence of a Nonlinear Programming Method Using Convex Approximations

The method of moving asymptotes (MMA) and its globally convergent extension SCP (sequential convex programming) are known to work well for certain problems arising in structural optimization. In this paper, the methods are extended for a general mathematical programming framework and a new scheme to update certain penalty parameters is defined, which leads to a considerable improvement in the performance. Properties of the approximation functions are outlined in detail. All convergence results of the traditional methods are preserved.     

On the Problem of Describing Sequences of Best Trigonometric Rational Approximations

For a strictly decreasing sequence a_{n n=0} of nonnegative real numbers converging to zero, we construct a continuous 2-periodic function f such that R^T _n(f) = a_n, n=0,1,2,..., where R^T _n(f) are best approximations of the function f in uniform norm by trigonometric rational functions of degree at most n.     

On the Semicontinuity of Curvature Integrals

Let H_j(K, ·) be the j – th elementary symmetric function of the principal curvatures of a convex body K in Euclidean d – space. We show that the functionals ∫_bd f(H_j(K, x)) dℋ︁^d—1(x) depend upper semicontinuously on K, if f : [0, ∞) is concave, lim_t→0f(t) = 0, and lim_t→∞f(t)/t = 0. An analogous statement holds for integrals of elementary symmetric functions of the principal radii of curvature.     

Extreme eigenvalues of real symmetric Toeplitz matrices

We exploit the even and odd spectrum of real symmetric Toeplitz matrices for the computation of their extreme eigenvalues, which are obtained as the solutions of spectral, or secular, equations. We also present a concise convergence analysis for a method to solve these spectral equations, along with an efficient stopping rule, an error analysis, and extensive numerical results.

     

一类奇异二阶系统边值问题的正解

本文利用正规锥和迭代法考察了一类奇异二阶系统边值问题的正解的存在性.我们的工作是对[1]的补充和发展.     

Banach空间的p— Asplund 伴随空间

我们称一个定义在Banach空间E上的连续凸函数f具有Frechet可微性质（FDP）,如果E上的每个实值凸函数g≤f均在E一个稠密的Gδ－子集上Frechet可微。本文主要证明了：对任何Banach空间E,均存在一个局部凸相容拓扑p使得1）（E,p)是Hausdorff局部凸空间;2） E上的每个范数连续具有FDP的凸函数均是p－连续的;3）每个p-连续的凸函数均具有FDP ;4）p等价某个范数拓扑当且仅不E是Asplund空间。