共查询到10条相似文献,搜索用时 93 毫秒
1.
In this paper, we consider a class of penalized NCP-functions, which includes several existing well-known NCP-functions as
special cases. The merit function induced by this class of NCP-functions is shown to have bounded level sets and provide error
bounds under mild conditions. A derivative free algorithm is also proposed, its global convergence is proved and numerical
performance compared with those based on some existing NCP-functions is reported. 相似文献
2.
A New Class of Semismooth Newton-Type Methods for Nonlinear Complementarity Problems 总被引:2,自引:0,他引:2
We introduce a new, one-parametric class of NCP-functions. This class subsumes the Fischer function and reduces to the minimum function in a limiting case of the parameter. This new class of NCP-functions is used in order to reformulate the nonlinear complementarity problem as a nonsmooth system of equations. We present a detailed investigation of the properties of the equation operator, of the corresponding merit function as well as of a suitable semismooth Newton-type method. Finally, numerical results are presented for this method being applied to a number of test problems. 相似文献
3.
Li-Yong LuWei-Zhe Gu 《Journal of Computational and Applied Mathematics》2011,235(8):2300-2313
Based on the generalized CP-function proposed by Hu et al. [S.L. Hu, Z.H. Huang, J.S. Chen, Properties of a family of generalized NCP-functions and a derivative free algorithm for complementarity problems, J. Comput. Appl. Math. 230 (2009) 69-82], we introduce a smoothing function which is a generalization of several popular smoothing functions. By which we propose a non-interior continuation algorithm for solving the complementarity problem. The proposed algorithm only needs to solve at most one system of linear equations at each iteration. In particular, we show that the algorithm is globally linearly and locally quadratically convergent under suitable assumptions. The preliminary numerical results demonstrate that the algorithm is effective. 相似文献
4.
In this paper, we propose a new family of NCP-functions and the corresponding merit functions, which are the generalization of some popular NCP-functions and the related merit functions. We show that the new NCP-functions and the corresponding merit functions possess a system of favorite properties. Specially, we show that the new NCP-functions are strongly semismooth, Lipschitz continuous, and continuously differentiable; and that the corresponding merit functions have SC1 property (i.e., they are continuously differentiable and their gradients are semismooth) and LC1 property (i.e., they are continuously differentiable and their gradients are Lipschitz continuous) under suitable assumptions. Based on the new NCP-functions and the corresponding merit functions, we investigate a derivative free algorithm for the nonlinear complementarity problem and discuss its global convergence. Some preliminary numerical results are reported. 相似文献
5.
We introduce a new NCP-function in order to reformulate the nonlinear complementarity problem as a nonsmooth system of equations.
This new NCP-function turns out to have stronger theoretical properties than the widely used Fischer-Burmeister function and
other NCP-functions suggested previously. Moreover, numerical experience indicates that a semismooth Newton method based on
this new NCP-function performs considerably better than the corresponding method based on the Fischer-Burmeister function.
Received: March 10, 1997 / Accepted: February 15, 2000?Published online May 12, 2000 相似文献
6.
《Journal of Computational and Applied Mathematics》1999,110(1):181-185
In a recent paper, Chen and Solis investigated the appearance of spurious solutions when first-order ODEs are discretized using Runge–Kutta schemes. They concluded that the reliability of the numerical solutions to a particular ODE could be verified only by constructing several discrete models and comparing their numerical results with the known properties of the exact solutions. We demonstrate that by using nonstandard schemes, all the difficulties found by Chen and Solis can be eliminated, and that qualitatively correct numerical solutions are obtained for all values of the step size. We illustrate these issues by applying nonstandard finite-difference techniques to the logistic, sine, cubic, and Monod equations. 相似文献
7.
8.
Qingchuan Yao 《Numerische Mathematik》1999,81(4):647-677
This paper proposes some modified Halley iterations for finding the zeros of polynomials. We investigate the non-overshoot
properties of the modified Halley iterations and other important properties that play key roles in solving symmetric eigenproblems.
We also extend Halley iteration to systems of polynomial equations in several variables.
Received March 20, 1996 / Revised version received December 5, 1997 相似文献
9.
We consider a regularization method for nonlinear complementarity problems with F being a P0-function which replaces the original problem with a sequence of the regularized complementarity problems. In this paper, this sequence of regularized complementarity problems are solved approximately by applying the generalized Newton method for an equivalent augmented system of equations, constructed by the generalized Fischer–Burmeister (FB) NCP-functions φp with p>1. We test the performance of the regularization semismooth Newton method based on the family of NCP-functions through solving all test problems from MCPLIB. Numerical experiments indicate that the method associated with a smaller p, for example p[1.1,2], usually has better numerical performance, and the generalized FB functions φp with p[1.1,2) can be used as the substitutions for the FB function φ2. 相似文献
10.
Jein-Shan Chen 《Journal of Global Optimization》2006,36(4):565-580
This paper is a follow-up of the work [Chen, J.-S.: J. Optimiz. Theory Appl., Submitted for publication (2004)] where an NCP-function and a descent method were proposed for the nonlinear complementarity problem. An unconstrained reformulation was formulated due to a merit function based on the proposed NCP-function. We continue to explore properties of the merit function in this paper. In particular, we show that the gradient of the merit function is globally Lipschitz continuous which is important from computational aspect. Moreover, we show that the merit function is SC
1 function which means it is continuously differentiable and its gradient is semismooth. On the other hand, we provide an alternative proof, which uses the new properties of the merit function, for the convergence result of the descent method considered in [Chen, J.-S.: J. Optimiz. Theory Appl., Submitted for publication (2004)]. 相似文献