共查询到20条相似文献,搜索用时 93 毫秒
1.
研究了无约束极大极小问题.通过引入一个可微的辅助函数,利用广义投影技术产生下降搜索方向,结合Armjio非精确线搜索建立了一个广义梯度投影算法.在初始点任意的条件下,证明了算法的全局收敛性. 相似文献
2.
一个求解线性不等式约束的非线性规划的广义梯度投影内点算法 总被引:1,自引:0,他引:1
基于内点算法思想,利用广义投影技术设计了求解带线性不等式约束和非负约束的非线性规划的广义梯度投影内点算法,并讨论了算法的收敛性质,数值例子表明算法是有效的. 相似文献
3.
基于修正拟牛顿方程,利用Goldstein-Levitin-Polyak(GLP)投影技术,建立了求解带凸集约束的优化问题的两阶段步长非单调变尺度梯度投影算法,证明了算法的全局收敛性和一定条件下的Q超线性收敛速率.数值结果表明新算法是有效的,适合求解大规模问题. 相似文献
4.
为了求解分裂可行问题,Yu等提出了一个球松弛CQ算法.由于该算法只需计算到闭球上的投影,同时不需要计算有界线性算子的范数,该算法是容易实现的.但是球松弛CQ算法在无穷维Hilbert空间中仅仅具有弱收敛性.首先构造了一个强收敛的球松弛CQ算法.在较弱的条件下,证明了算法的强收敛性.其次将该算法应用到一类闭凸集上的投影问... 相似文献
5.
拟变分不等式问题在经济、工程,最优化和控制等领域都有着广泛的应用,目前,对拟变分不等式问题的研究还处于初级阶段.在本文中,我们利用梯度投影技术,给出了一种求解拟变分不等式问题的投影类算法,证明了该算法的全局收敛性,并给出了数值试验结果. 相似文献
6.
7.
等式约束优化一个修正的投影变尺度法 总被引:1,自引:0,他引:1
本文研究了等式约束优化问题.利用罚函数和投影变尺度方法,得到了一个修正的算法及其全局收敛与超线性收敛率.改进了文献[J]中的方法. 相似文献
8.
一个求解线性不等式约束的非线性规划的广义梯度投影内点 … 总被引:1,自引:0,他引:1
基于内点算法思想,利用广义投影技术设计了求解带线性不等式约束和非负约束的非线性规划的广义梯度投影内点算法,并了算法的收敛性质,数值例子表明算法是有效的。 相似文献
9.
本文给出求解界约束优化问题的一种新的非单调谱投影梯度算法. 该算法是将谱投影梯度算法与Zhang and Hager [SIAM Journal on Optimization,2004,4(4):1043-1056]提出的非单调线搜索结合得到的方法. 在合理的假设条件下,证明了算法的全局收敛性.数值实验结果表明,与已有的界约束优化问题的谱投影梯度法比较,利用本文给出的算法求解界约束优化问题是有竞争力的. 相似文献
10.
11.
Two Convergence Problems for Monotone Sequences 总被引:1,自引:0,他引:1
Eight measures of rate of convergence of monotone sequences of real numbers have been proposed and discussed in a paper by Beyer, Ebanks, and Qualls (Acta Appl. Math. 20 (1990), 267–284). These rates arose in discussions of dynamical systems. In the comparisons of these rates, two problems remained. A complete answer is given to one of the problems and a partial answer is given to the other problem. 相似文献
12.
1. IntroductionWe are concerned with the following variational inequality problem of finding amx E X such thatwhere f: R" - R" is assumed to be a continuously differentiable function, and X g R"is specified bywhere gi: R" -- R and h,-: R" - R are twice continuously differentiable functions.The variational inequality (1.1) is denoted by VI(X, f). An important special case ofVI(X, f) is the so--called nonlinear complementarity problem (NCP(f)) with X ~ R7 {x E R" I x 2 0}. Variational… 相似文献
13.
一类新的共轭投影梯度算法 总被引:2,自引:0,他引:2
本文利用[5]引进的共轭投影的概念,结合堵丁柱[3]中的思想,提出一类新的共轭梯度投影算法.在一定的条件下,证明了该算法具有全局收敛性和超线性收敛速度. 相似文献
14.
We propose a non-interior continuation algorithm for the solution of the linear
complementarity problem (LCP) with a P0 matrix. The proposed algorithm
differentiates itself from the current continuation algorithms by combining good global
convergence properties with good local convergence properties under unified conditions.
Specifically, it is shown that the proposed algorithm is globally convergent under an
assumption which may be satisfied even if the solution set of the LCP is unbounded.
Moreover, the algorithm is globally linearly and locally superlinearly convergent under
a nonsingularity assumption. If the matrix in the LCP is a P* matrix, then the
above results can be strengthened to include global linear and local quadratic
convergence under a strict complementary condition without the nonsingularity
assumption. 相似文献
15.
LiangXiming LiFei XuChengxian 《高校应用数学学报(英文版)》2000,15(4):470-482
By using Fukushima‘s differentiable merit function,Taji,Fukushima and Ibaraki have given a globally convergent modified Newton method for the strongly monotone variational inequality problem and proved their method to be quadratically convergent under certain assumptions in 1993. In this paper a hybrid method for the variational inequality problem under the assumptions that the mapping F is continuously differentiable and its Jacobian matrix F(x) is positive definite for all x∈S rather than strongly monotone and that the set S is nonempty, polyhedral,closed and convex is proposed. Armijo-type line search and trust region strategies as well as Fukushima‘s differentiable merit function are incorporated into the method. It is then shown that the method is well defined and globally convergent and that,under the same assumptions as those of Taji et al. ,the method reduces to the basic Newton method and hence the rate of convergence is quadratic. Computational experiences show the efficiency of the proposed method. 相似文献
16.
定义了单调收敛函数和交错收敛函数,并根据其收敛特点,提出并证明了加快其收敛速度的两个命题.算例表明其效果较好. 相似文献
17.
In this paper, an improved interior-type feasible QP-free algorithm for inequality constrained optimization problems is proposed. At each iteration, by solving three systems of linear equations with the same coefficient matrix, a search direction is generated. The algorithm is proved to be globally and superlinearly convergent under some mild conditions. Preliminary numerical results show that the proposed algorithm may be promising. Advantages of the algorithm include: the uniformly nonsingularity of the coefficient matrices without the strictly complementarity condition is obtained. Moreover, the global convergence is achieved even if the number of the stationary points is infinite. 相似文献
18.
BABAIE-KAFAKI Saman 《中国科学 数学(英文版)》2011,(9)
By making a convex combination of the modified secant equations proposed by Yuan and Wei et al.,a hybrid secant equation and also,a modified BFGS algorithm is proposed.The hybridization parameter is effectively computed using the available information of recent iterations.Under proper conditions,it is shown that the proposed algorithm is globally,locally and superlinearly convergent.By using the performance profile introduced by Dolan and Mor'e,a comparison between the implementations of the proposed algori... 相似文献
19.
Lower-dimensional linear complementarity problem approaches to the solution of a bi-obstacle problem
A globally convergent Broyden-like method for solving a bi-obstacle problem is proposed based on its equivalent lower-dimensional linear complementarity problem. A suitable line search technique is introduced here. The global and superlinear convergence of the method is verified under appropriate assumptions. 相似文献