Properties of S-tensors

Strict feasibility is an important issue in studies on the theory and algorithms of complementarity problems. For the tensor complementarity problem, strict feasibility can be characterized by the S-tensor. In this paper, we discuss properties of S-tensors. We illustrate that principal sub-tensors of an S-tensor are not always an S-tensor. In particular, we propose several necessary and/or sufficient conditions to judge whether a tensor is an S-tensor or not. Moreover, we also discuss relationship among S-tensors and several related tensors.     

高温超导电缆节能环保与经济可行性分析

人们对电能需求的持续增长,促使电网输电密度和输电容量逐渐增大,传统的输电技术将遇到越来越多的问题,这个矛盾在大城市中显得尤为突出。高温超导电缆具有传输容量大和功率密度高等优势,是解决这些问题和满足未来大容量电力传输的重要技术之一。文中在介绍高温超导电缆的基本结构和发展现状的基础上,研究其在节能环保和经济方面的优势;并以北京为例,分析了高温超导电缆在大城市中应用的可行性。     

TL法和UL法对刚架弹性大位移分析的适用性

本文分别基于Total Lagrange(TL)和Updated Lagrange(UL)描述分别导出了适用于刚架问题几何非线性分析的有限元公式系统，并研制了相应的计算程序，文中从量化的角度讨论了上述两种列式方法在通常情况下的适用性，并研究了诸如有限单元划分、杆件中轴向力的大小以及采用通常积分方法或积分平均化方法时等多种因素对于有限单元TL法和UL法适用性方面的影响，本文得出了一些相对量化的结论，对于非线性有限元方法的实际工程应用具有一定的指导意义。     

基于两层供应链的VMI系统可行性分析研究

一般来说，供应商管理用户库存（VMI）能够给购买方带来更高的利润，而对供货方的影响却是不确定的。而现实中很多VMI策略都是由购买方主导的，购买方一般不愿和供货方分享收益，因此供货方必须自己判断是否接受VMI策略。本文在基于对安徽奇瑞汽车集团的零部件库存进行的调查的基础上，对VMI系统可行性分析的研究分两步进行：（1）假设供货方已经接受了购买方主导的VMI策略，它如何制定自己的最优送货策略；（2）通过比较供货方分别在RMI和VMI下的最小成本，供货方决定是否接受购买方主导的VMI策略。     

平衡约束优化问题可行的充分条件

提出了平衡约束优化问题可行的一个充分性条件,该类优化问题中除平衡约束以外的关联约束中允许同时出现状态变量和设计变量.     

A note on some analytic center cutting plane methods for convex feasibility and minimization problems

Recently Goffin, Luo and Ye have analyzed the complexity of an analytic center algorithm for convex feasibility problems defined by a separation oracle. The oracle is called at the (possibly approximate) analytic center of the set given by the linear inequalities which are the previous answers of the oracle. We discuss oracles for the problem of minimizing a convex (possibly nondifferentiable) function subject to box constraints, and give corresponding complexity estimates.The research of the first author is supported by the Polish Academy of Sciences; the research of the second author is supported by the State Committee for Scientific Research under Grant 8S50502206.     

Algorithms with new parameter conditions for split variational inclusion problems in Hilbert spaces with application to split feasibility problem

Split variational inclusion problem is an important problem, and it is a generalization of the split feasibility problem. In this paper, we present feasible algorithms for the split variational inclusion problems in Hilbert spaces, and provide convergence theorems for these algorithms. As application, we study the split feasibility problem in real Hilbert spaces. Final, numerical results are given for our main results.     

Remark on the Successive Projection Algorithm for the Multiple-Sets Split Feasibility Problem

Recently, assuming that the metric projection onto a closed convex set is easily calculated, Liu et al. (Numer. Func. Anal. Opt. 35:1459–1466, 2014) presented a successive projection algorithm for solving the multiple-sets split feasibility problem (MSFP). However, in some cases it is impossible or needs too much work to exactly compute the metric projection. The aim of this remark is to give a modification to the successive projection algorithm. That is, we propose a relaxed successive projection algorithm, in which the metric projections onto closed convex sets are replaced by the metric projections onto halfspaces. Clearly, the metric projection onto a halfspace may be directly calculated. So, the relaxed successive projection algorithm is easy to implement. Its theoretical convergence results are also given.