Hilbert空间中的广义非线性变分不等式组的投影算法

利用投影技术讨论了Hilbert空间中一类含松弛伪上强制映射的广义非线性变分不等式组的逼近解及其收敛性,所得到结果推广和统一了系列最新结果.     

A numerically stable least squares solution to the quadratic programming problem

The strictly convex quadratic programming problem is transformed to the least distance problem — finding the solution of minimum norm to the system of linear inequalities. This problem is equivalent to the linear least squares problem on the positive orthant. It is solved using orthogonal transformations, which are memorized as products. Like in the revised simplex method, an auxiliary matrix is used for computations. Compared to the modified-simplex type methods, the presented dual algorithm QPLS requires less storage and solves ill-conditioned problems more precisely. The algorithm is illustrated by some difficult problems.      

On stable least squares solution to the system of linear inequalities

The system of inequalities is transformed to the least squares problem on the positive ortant. This problem is solved using orthogonal transformations which are memorized as products. Author’s previous paper presented a method where at each step all the coefficients of the system were transformed. This paper describes a method applicable also to large matrices. Like in revised simplex method, in this method an auxiliary matrix is used for the computations. The algorithm is suitable for unstable and degenerate problems primarily.      

Minimal representation of convex polyhedral sets

A system of linear inequality and equality constraints determines a convex polyhedral set of feasible solutionsS. We consider the relation of all individual constraints toS, paying special attention to redundancy and implicit equalities. The main theorem derived here states that the total number of constraints together determiningS is minimal if and only if the system contains no redundant constraints and/or implicit equalities. It is shown that the existing theory on the representation of convex polyhedral sets is a special case of the theory developed here.The author is indebted to Dr. A. C. F. Vorst (Erasmus University, Rotterdam, Holland) for stimulating discussions and comments, which led to considerable improvements in many proofs. Most of the material in this paper originally appeared in the author's dissertation (Ref. 1). The present form was prepared with partial support from a NATO Science Fellowship for the Netherlands Organization for the Advancement of Pure Research (ZWO) and a CORE Research Fellowship.     

两步投影对变分不等方程组解的迭代逼近

本文研究Hilbert空间中两步投影方法及其对变分不等方程组解具误差的迭代序列的收敛性.本文结果发展和改进了Verma等人的最新结果.     

On a General Projection Algorithm for Variational Inequalities

Let H be a real Hilbert space with norm and inner product denoted by and . Let K be a nonempty closed convex set of H, and let f be a linear continuous functional on H. Let A, T, g be nonlinear operators from H into itself, and let be a point-to-set mapping. We deal with the problem of finding uK such that g(u)K(u) and the following relation is satisfied: , where >0 is a constant, which is called a general strong quasi-variational inequality. We give a general and unified iterative algorithm for finding the approximate solution to this problem by exploiting the projection method, and prove the existence of the solution to this problem and the convergence of the iterative sequence generated by this algorithm.     

空间直线在平面上投影的求解方法

介绍了求解空间直线在平面上投影的五种方法,旨在对空间直线的投影问题有更深的理解和掌握.     

基于向量投影的建筑工程绩效评价

首先结合建筑工程项目管理实践,建立建筑工程绩效评价指标体系.然后利用相对隶属度公式对数据进行规范化处理、利用线性规划确定指标因素的权重、利用向量的投影公式求实际评价值与目标评价值的接近程度来对建筑工程管理绩效进行评价.案例说明评价方法是确实可行的,也很通俗易懂.     

Block Projection Methods for Linear Systems

The aim of this paper is to provide a theory of block projection methods for the solution of a system of linear equations with multiple right-hand sides. Our approach allows to obtain recursive algorithms for the implementation of these methods.     

A Probe Method of Gradient Projection Type

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＷｅｃｏｎｓｉｄｅｒｔｈｅｆｏｌｌｏｗｉｎｇｏｐｔｉｍｉｚａｔｉｏｎｐｒｏｂｌｅｍ：（Ｐ）　　ｍｉｎｘ∈Ｘｆ（ｘ）（１）ｗｈｅｒｅＸ＝｛ｘ｜ｘ∈Ｅｎ,ｇｊ（ｘ）≤０,ｊ＝１,２,…,ｍ;ｇｊ（ｘ）＝０,ｊ＝ｍ＋１,…,ｍ＋ｌ｝,ｌｅｔＩ＝｛１,２,…,ｍ｝,Ｌ＝｛ｍ＋１,…,ｍ＋ｌ｝．Ｆｏｒｔｈｅｐｒｏｂｌｅｍ（Ｐ）ｗｉｔｈＬ＝,ｍａｎｙｅｆｆｉｃｉｅｎｔｐｒｏｊｅｃｔｉｏｎｔｙｐｅａｌｇｏｒｉｔｈｍｓ［１－１１］ｈａｖｅｂｅｅｎｐｒｏｐｏｓｅｄ．Ｉｎ［１２］,…     

变分不等式的一类二次投影算法

通过构造的一类严格分离当前点与解集的超平面得到了一类解伪单调变分不等式的修正二次投影算法,该算法对He Yiran的算法进行了修正.从而建立了解伪单调变分不等式二次投影算法的一种框架结构.证明了该算法生成的无穷序列具有的全局收敛性,在具备某种局部误差界和Lipchitz连续条件下给出了收敛率分析.并给出了该算法的数值演算结果.     

多指标决策与评价的新方法——主成份投影法

本文介绍了主成份投影法的原理和实施步骤 ,并对全国 31个省、自治区和直辖市的 1998年经济效益指标进行综合分析和排序     

Hoffman’s Least Error Bounds for Systems of Linear Inequalities

Let E be a normed space, and . Let . We give some exact formulas for 7#x03C4;.     

On a Generalized System for Relaxed Cocoercive Variational Inequalities and Projection Methods

Verma introduced a system of nonlinear variational inequalities and proposed projection methods to solve it. This system reduces to a variational inequality problem under certain conditions. So, at least in form, it can be regarded as a extension of a variational inequality problem. In this note, we show that solving this system coincides exactly with solving a variational inequality problem. Therefore, we conclude that it suffices to study the corresponding variational inequalities.This work was supported by the National Natural Science Foundation of China, Grant 10571134.Communicated by M. J. Balas     

Generalized System for Relaxed Cocoercive Variational Inequalities and Projection Methods

Let K be a nonempty closed convex subset of a real Hilbert space H. The approximate solvability of a system of nonlinear variational inequality problems, based on the convergence of projection methods, is discussed as follows: find an element (x*, y*)K×K such that

Modified Goldstein–Levitin–Polyak Projection Method for Asymmetric Strongly Monotone Variational Inequalities

In this paper, we present a modified Goldstein–Levitin–Polyak projection method for asymmetric strongly monotone variational inequality problems. A practical and robust stepsize choice strategy, termed self-adaptive procedure, is developed. The global convergence of the resulting algorithm is established under the same conditions used in the original projection method. Numerical results and comparison with some existing projection-type methods are given to illustrate the efficiency of the proposed method.     

三步投影算法的收敛性及其在变分不等式组中的应用

First a general model for a three-step projection method is introduced, and second it has been applied to the approximation solvability of a system of nonlinear variational inequality problems in a Hilbert space setting. Let H be a real Hilbert space and K be a nonempty closed convex subset of H. For arbitrarily chosen initial points x0, y0, z0 ∈ K,compute sequences xn, yxn, zxn such that { xn+1=(1-αn-rn)xn+αxPk[yn-ρTyn]+rnun,yn=(1-β-δn)xn+βnPk[zn-ηTxn]+δnun,zn=(1-an-λn)xn+akPk[xn-γTxn]+λnwn.For η, ρ,γ>0 are constants,{αn}, {βn}, {an}, {rn}, {δn}, {λn} C [0,1], {un}, {vn}, {wn} are sequences in K, and 0≤n + rn ≤ 1,0 ≤βn + δn ≤ 1,0 ≤ an + λn ≤ 1,(A)n ≥ 0, where T : K → H is a nonlinear mapping onto K. At last three-step models are applied to some variational inequality problems.     

解变分不等式的一种二次投影算法

该文研究一种新的解变分不等式的二次投影算法.通过构造一类新的严格分离当前迭代和变分不等式解集的超平面,进而建立了解决伪单调变分不等式投影算法的一种新的框架.通过改进已有结果的证明方法,证明了该算法生成的无穷序列是全局收敛的,并且在局部误差和Lipschitz条件下给出了收敛率分析.     

也谈直线和平面投影阵的应用

针对空间解析几何中的投影与垂直问题,引入直线和平面的投影阵与投影公式,从计算空间角与距离,体积和对称以及判断直线共面等方面给出求解结论,以展示投影阵在理论推导和实际计算中的应用.     

Extended Projection Methods for Monotone Variational Inequalities

In this paper, we prove that each monotone variational inequality is equivalent to a two-mapping variational inequality problem. On the basis of this fact, a new class of iterative methods for the solution of nonlinear monotone variational inequality problems is presented. The global convergence of the proposed methods is established under the monotonicity assumption. The conditions concerning the implementability of the algorithms are also discussed. The proposed methods have a close relationship to the Douglas–Rachford operator splitting method for monotone variational inequalities.