关于矩阵和算子迹的一组不等式

给出关于半正定矩阵迹和正算子迹的一组不等式,得到与邱贤忠关于实数的不等式的类似结果.     

Some results on quasipolyhedral convexity

The objective of this paper is to analyze under what well-known operations the class of quasipolyhedral convex functions, which can be regarded as an extension of that of polyhedral convex functions, is closed. The operations that will be considered are those that preserve polyhedral convexity, such that the image and the inverse image under linear transformations, right scalar multiplication (including the case where λ=0⁺) and pointwise addition.      

Mixed Elastico-Plasticity Problems with Partially Unknown Boundaries

In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

Pearson-χ~2距离的若干性质

本文对数理统计中常用的 Pearson- χ2距离的分析特性进行了讨论 ,得到了这一距离的一些解析性质 ,最后我们还给出了几个常用距离的关系 .     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.     

An approximate proximal-extragradient type method for monotone variational inequalities

Proximal point algorithms (PPA) are attractive methods for monotone variational inequalities. The approximate versions of PPA are more applicable in practice. A modified approximate proximal point algorithm (APPA) presented by Solodov and Svaiter [Math. Programming, Ser. B 88 (2000) 371–389] relaxes the inexactness criterion significantly. This paper presents an extended version of Solodov–Svaiter's APPA. Building the direction from current iterate to the new iterate obtained by Solodov–Svaiter's APPA, the proposed method improves the profit at each iteration by choosing the optimal step length along this direction. In addition, the inexactness restriction is relaxed further. Numerical example indicates the improvement of the proposed method.     

CONSTRUCTION OF SOME KIESSWETTER-LIKE FUNCTIONS-THE CONTINUOUS BUT NON-DIFFERENTIABLE FUNCTION DEFINED BY QUINARY DECIMAL

In this paper, we construct some continuous but non-differentiable functions defined by quinary decimal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof.     

GENERALIZED CIRCLES AND THEIR CONFORMAL MAPPING IN A SUBSPACE OF A WEYL SPACE

The authors give the necessary and sufficient conditions for a generalized circle in a Weyl hypersurface to be generalized circle in the enveloping Weyl space. They then obtain the neccessary and sufficient conditions under which a generalized concircular transformation of one Weyl space onto another induces a generalized transformation oil its subspaces. Finally, it is shown that any totally geodesic or totally umbilical hypersurface of a generalized concircularly flat Weyl space is also generalized concircularly flat.