首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
对非线性参数规划问题ε-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对ε-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出了非线性参数规划问题ε-最优解集集值映射连续的一个充分条件.  相似文献   

2.
对非线性参数规划问题$\varepsilon$-最优解集集值映射的连续性条件进行了研究.首先在可行集集值映射局部有界且正则的条件下,讨论了非线性参数规划问题最优值函数的连续性,然后针对$\varepsilon$-最优解集集值映射的结构特征并利用此结果和集值分析理论,给出了非线性参数规划问题$\varepsilon$-最优解集集值映射连续的一个充分条件.  相似文献   

3.
研究向量集值映射的拟均衡问题的有效解,利用数值化方法与不动点定理,得到解的存在性定理.作为应用,得到广义向量鞍点,向量变分不等式与向量互补问题的存在性定理.  相似文献   

4.
本文在二阶锥上引入一类新的映射,称之为笛卡尔P_*(κ)映射,它是单调映射的推广.文中讨论涉及这类映射的二阶锥互补问题的解的存在性和解集的有界性.主要结论为:如果所考虑的互补问题是严格可行的,那么它的解集是非空有界的.  相似文献   

5.
本文研究了集值映射向量优化问题的锥弱有效解的镇定性和稳定性,我们引进了集值映射向量优化问题的镇定性和稳定性的定义,并证明了集值映射向量优化问题的镇定性和稳定性的一些主要定理.  相似文献   

6.
利用集值映射的自然拟C-凸性和集值映射的下(-C)-连续性的定义以及Kakutani-Fan-Glicksberg不动点定理,在不要求锥C的对偶锥C~*具有弱*紧基的情况下,建立了集值广义强向量拟均衡问题解的存在性定理.把相关文献中所得的关于单值映射解的存在性结果推广到了集值映射的情形.  相似文献   

7.
在可行集扰动而向量值映射不扰动、可行集与向量值映射均扰动、可行集扰动而集值映射不扰动以及可行集与集值映射均扰动四种情况下,分别讨论了向量均衡问题强有效解的稳定性.  相似文献   

8.
给出实的赋范空间中集值映射的Henig真有效解集的一些性质,并利用集值映射的相依上图导数和集值映射的次微分给出了集值优化问题Henig真有效解的最优性条件的充要条件.  相似文献   

9.
向量集值优化超有效解的对偶问题   总被引:2,自引:0,他引:2       下载免费PDF全文
借助于Contingent切锥和集值映射的上图而引入的有关集值映射的Contingent切导数,对约束集值优化问题的超有效解建立了最优性Kuhn Tucker必要及充分性条件,借此建立了向量集值优化超有效解的Wolfe型和Mond Weir型对偶定理.  相似文献   

10.
赵亚莉  沈璐 《数学杂志》2017,37(3):527-532
本文研究了一类集值广义强向量拟均衡问题组解的存在性问题.利用集值映射的自然拟C-凸性和集值映射的下(-C)-连续性的定义和Kakutani-Fan-Glicksberg不动点定理,在不要求锥C的对偶锥C~*具有弱*紧基的情况下,建立了该类集值广义强向量拟均衡问题组解的存在性定理.所得结果推广了该领域的相关结果.  相似文献   

11.
The nonlinear complementarity problem can be reformulated as unconstrained minimization problems by introducing merit functions. Under some assumptions, the solution set of the nonlinear complementarity problem coincides with the set of local minima of the corresponding minimization problem. These results were presented by Mangasarian and Solodov, Yamashita and Fukushima, and Geiger and Kanzow. In this note, we generalize some results of Mangasarian and Solodov, Yamashita and Fukushima, and Geiger and Kanzow to the case where the considered function is only directionally differentiable. Some results are strengthened in the smooth case. For example, it is shown that the strong monotonicity condition can be replaced by the P-uniform property for ensuring a stationary point of the reformulated unconstrained minimization problems to be a solution of the nonlinear complementarity problem. We also present a descent algorithm for solving the nonlinear complementarity problem in the smooth case. Any accumulation point generated by this algorithm is proved to be a solution of the nonlinear complementarity under the monotonicity condition.  相似文献   

12.
对称线性互补问题的乘性Schwarz算法   总被引:1,自引:0,他引:1  
曾金平  陈高洁 《应用数学》2005,18(3):384-389
本文提出了求解对称性互补问题的乘性Schwarz算法,其中子问题用投影迭代方法求解.利用投影迭代算子的性质及投影迭代的收敛性,证明了算法产生的迭代点列的聚点为原互补问题的解,并在一定条件下,证明算法产生的迭代点列的聚点存在.  相似文献   

13.
Under some assumptions, the solution set of a nonlinear complementarity problem coincides with the set of local minima of the corresponding minimization problem. This paper uses a family of new merit functions to deal with nonlinear complementarity problem where the underlying function is assumed to be a continuous but not necessarily locally Lipschitzian map and gives a descent algorithm for solving the nonsmooth continuous complementarity problems. In addition, the global convergence of the derivative free descent algorithm is also proved.  相似文献   

14.
The basic theorm of (linear) complementarity was stated in a 1971 paper [6] by B.C. Eaves who credited C.E. Lemke for giving a constructive proof based on his almost complementary pivot algorithm. This theorem asserts that associated with an arbitrary linear complementarity problem, a certain augmented problem always possesses a solution. Many well-known existence results pertaining to the linear complementarity problem are consequences of this fundamental theorem.In this paper, we explore some further implications of the basic theorem of complementarity and derive new existence results for the linear complementarity problem. Based on these results, conditions for the existence of a solution to a linear complementarity problem with a fully-semimonotone matrix are examined. The class of the linear complementarity problems with aG-matrix is also investigated.The work of this author was based on research supported by the National Science Foundation under grant ECS-8717968.  相似文献   

15.
In this paper, we study the linear complementarity problems on extended second order cones. We convert a linear complementarity problem on an extended second order cone into a mixed complementarity problem on the non-negative orthant. We state necessary and sufficient conditions for a point to be a solution of the converted problem. We also present solution strategies for this problem, such as the Newton method and Levenberg–Marquardt algorithm. Finally, we present some numerical examples.  相似文献   

16.
针对拟P_*-映射和P(τ,α,β)-映射所对应的非线性互补问题,本文对其解的存在性及有效求解算法进行了研究.文中利用组合同伦方法给出了这两类非线性互补问题存在有界解的构造性证明,并利用预估校正方法对同伦路径进行跟踪,得到了互补问题的解.通过数值算例验证了该算法的有效性.  相似文献   

17.
We describe an algorithm for the monotone linear complementarity problem (LCP) that converges from any positive, not necessarily feasible, starting point and exhibits polynomial complexity if some additional assumptions are made on the starting point. If the problem has a strictly complementarity solution, the method converges subquadratically. We show that the algorithm and its convergence properties extend readily to the mixed monotone linear complementarity problem and, hence, to all the usual formulations of the linear programming and convex quadratic programming problems.This research was supported by the Office of Scientific Computing, U.S. Department of Energy, under Contract W-31-109-Eng-38.  相似文献   

18.
In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm terminates with a simplex, one of whose vertices is an integral solution of the complementarity problem under consideration.  相似文献   

19.
Interior–point algorithms are among the most efficient techniques for solving complementarity problems. In this paper, a procedure for globalizing interior–point algorithms by using the maximum stepsize is introduced. The algorithm combines exact or inexact interior–point and projected–gradient search techniques and employs a line–search procedure for the natural merit function associated with the complementarity problem. For linear problems, the maximum stepsize is shown to be acceptable if the Newton interior–point search direction is employed. Complementarity and optimization problems are discussed, for which the algorithm is able to process by either finding a solution or showing that no solution exists. A modification of the algorithm for dealing with infeasible linear complementarity problems is introduced which, in practice, employs only interior–point search directions. Computational experiments on the solution of complementarity problems and convex programming problems by the new algorithm are included.  相似文献   

20.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号