初始点任意的解非线性不等式约束优化问题的结合共轭梯度参数的超记忆梯度广义投影算法

本文利用广义投影矩阵，对求解无约束规划的超记忆梯度算法中的参数给出一种新的取值范围以保证得到目标函数的超记忆梯度广义投影下降方向，并与处理任意初始点的方法技巧结合建立求解非线性不等式约束优化问题的一个初始点任意的超记忆梯度广义投影算法，在较弱条件下证明了算法的收敛性．同时给出结合FR，PR，HS共轭梯度参数的超记忆梯度广义投影算法，从而将经典的共轭梯度法推广用于求解约束规划问题．数值例子表明算法是有效的．     

拓扑空间中的连续逼近选择和几乎不动点

本文研究连续逼近选择问题 研究结果表明 ,几乎下半连续的集值映射有连续逼近选择 .从而 ,著名的Michael连续逼近选择定理被改进 .应用这个结果 ,一个几乎不动点定理被获得     

测度链上非线性微分方程的三正解

运用文[1]中的Leggett—Williams不动点定理，我们给出了测度链上的非线性微分方程-x^△△(t)=f(t,x(σ(t))),t∈[a,b,]关于两点边值条件ax(a)-βx^△(a)=0，γx(σ(b)) δx^△(σ(b))=0三正解存在性准则。     

Banach空间中渐近非扩张型映象的Ishikawa迭代序列的收敛问题

文章研究了Banach空间中渐近非扩张型映象的具误差的修正Ishikawa迭代序列的收敛问题，所得结果改进和发展了文献[1-6]的相关结果。     

A New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods

Multistage stochastic linear programming (MSLP) is a powerful tool for making decisions under uncertainty. A deterministic equivalent problem of MSLP is a large-scale linear program with nonanticipativity constraints. Recently developed infeasible interior point methods are used to solve the resulting linear program. Technical problems arising from this approach include rank reduction and computation of search directions. The sparsity of the nonanticipativity constraints and the special structure of the problem are exploited by the interior point method. Preliminary numerical results are reported. The study shows that, by combining the infeasible interior point methods and specific decomposition techniques, it is possible to greatly improve the computability of multistage stochastic linear programs.     

Remarks on the Analytic Centers of Convex Sets

In this paper we analyze properties of the analytic centers for perturbed convex problems. In particular we study the continuity of convex regions with respect to such characteristics as boundedness, full dimensionality and the existence of an analytic centre. Furthermore, we state the necessary and sufficient conditions for the existence of the analytic centre for possibly unbounded regions and we show that the analytic centre is identical for any minimal representation of the convex set. We are also concerned with the limiting behaviour of the central path as it approaches the set of optimal solutions of the problem.     

An iterative method for generalized set-valued nonlinear mixed quasi-variational inequalities

This paper presents an iterative method for solving the generalized nonlinear set-valued mixed quasi-variational inequality, a problem class that was introduced by Huang et al. (Comp. Math. Appl. 40 (2–3) (2000) 205–215). The method incorporates step size controls that enable application to problems where certain set-valued mappings do not always map to nonempty closed bounded sets.     

单位球面间的等距延拓

本文证明了在一定条件下赋范线性空间与其共轭空间的单位球面之间的等距算子可以延拓为全空间的实线性等距算子。进而,刻画了光滑的自反空间的单位球面到其共轭空间的单位球面上的等距算子。     

An efficient Fréchet differentiable high breakdown multivariate location and dispersion estimator

A good robust functional should, if possible, be efficient at the model, smooth, and have a high breakdown point. M-estimators can be made efficient and Fréchet differentiable by choosing appropriate ψ-functions but they have a breakdown point of at most 1/(p + 1) in p dimensions. On the other hand, the local smoothness of known high breakdown functionals has not been investigated. It is known that Rousseeuw's minimum volume ellipsoid estimator is not differentiable and that S-estimators based on smooth functions force a trade-off between efficiency and breakdown point. However, by using a two-step M-estimator based on the minimum volume ellipsoid we show that it is possible to obtain a highly efficient, Fréchet differentiable estimator whilst still retaining the breakdown point. This result is extended to smooth S-estimators.     

Two periodic solutions of second-order neutral functional differential equations

In this paper, we consider a type of second-order neutral functional differential equations. We obtain some existence results of multiplicity and nonexistence of positive periodic solutions. Our approach is based on a fixed point theorem in cones.