共查询到20条相似文献,搜索用时 0 毫秒
1.
In this paper, we describe a recursive method for computing interpolants defined in a space spanned by a finite number of continuous functions in Rd. We apply this method to construct several interpolants such as spline interpolants, tensor product interpolants and multivariate polynomial interpolants. We also give a simple algorithm for solving a multivariate polynomial interpolation problem and constructing the minimal interpolation space for a given finite set of interpolation points. 相似文献
2.
Let =(a=x0<x1<<xn=b) be a partition of an interval [a,b] of R, and let f be a piecewise function of class Ck on [a,b] except at knots xi where it is only of class
, kik. We study in this paper a novel method which smooth the function f at xi, 0in. We first define a new basis of the space of polynomials of degree 2k+1, and we describe algorithms for smoothing the function f. Then, as an application, we give a recursive computation of classical Hermite spline interpolants, and we present a method which allows us to compress Hermite data. The most part of these results are illustrated by some numerical examples.
AMS subject classification 41A05, 41A15, 65D05, 65D07, 65D10 相似文献
3.
In this paper, we present a new one‐step smoothing Newton method for solving the second‐order cone complementarity problem (SOCCP). Based on a new smoothing function, the SOCCP is approximated by a family of parameterized smooth equations. At each iteration, the proposed algorithm only need to solve one system of linear equations and perform only one Armijo‐type line search. The algorithm is proved to be convergent globally and superlinearly without requiring strict complementarity at the SOCCP solution. Moreover, the algorithm has locally quadratic convergence under mild conditions. Numerical experiments demonstrate the feasibility and efficiency of the new algorithm. Copyright © 2010 John Wiley & Sons, Ltd. 相似文献
4.
Xiangsong Zhang Sanyang Liu Zhenhua Liu 《Journal of Computational and Applied Mathematics》2010,234(3):713-721
In this paper, we focus on the variational inequality problem. Based on the Fischer-Burmeister function with smoothing parameters, the variational inequality problem can be reformulated as a system of parameterized smooth equations, a non-interior-point smoothing method is presented for solving the problem. The proposed algorithm not only has no restriction on the initial point, but also has global convergence and local quadratic convergence, moreover, the local quadratic convergence is established without a strict complementarity condition. Preliminary numerical results show that the algorithm is promising. 相似文献
5.
By using the smoothing functions and the least square reformulation, in this paper, we present a smoothing least square method for the nonlinear complementarity problem. The method can overcome the difficulty of the non‐smooth method and a major drawback of some existed equation‐based methods. Under the standard assumptions, we obtain the global convergence of the proposed method. Copyright © 2013 John Wiley & Sons, Ltd. 相似文献
6.
In last decades, there has been much effort on the solution and the analysis of the mixed complementarity problem (MCP) by reformulating MCP as an unconstrained minimization involving an MCP function. In this paper, we propose a new modified one-step smoothing Newton method for solving general (not necessarily P0) mixed complementarity problems based on well-known Chen-Harker-Kanzow-Smale smooth function. Under suitable assumptions, global convergence and locally superlinear convergence of the algorithm are established. 相似文献
7.
不可定向的流形曲面不仅在拓扑学中占据重要的地位,在可视化和极小曲面等问题中也有很多的应用.从拓扑学的观点来看,二流形曲面的每个局部与圆盘同胚,该性质与曲面的全局可定向性无关.但在离散化的网格表示上,可定向的二流形曲面常用半边结构来表达,而不可定向的二流形曲面大多表达成若干多边形的集合,这给以可定向网格曲面为主要研究对象的数字几何处理带来很多不便.本文提出了把不可定向的二流形网格曲面上的测地距离问题转化到可定向曲面上进行处理的一般算法框架.该框架有望在不可定向的二流形网格曲面与传统数字几何处理方法之间搭起一座桥梁.为了展示该算法框架的普适性,本文将其应用于不可定向曲面上的三个重要场合,包括测地距离的求解、离散指数映射和最远点采样. 相似文献
8.
In this article, an approach for solving finite minimax problems is proposed. This approach is based on the use of hyperbolic smoothing functions. In order to apply the hyperbolic smoothing we reformulate the objective function in the minimax problem and study the relationship between the original minimax and reformulated problems. We also study main properties of the hyperbolic smoothing function. Based on these results an algorithm for solving the finite minimax problem is proposed and this algorithm is implemented in general algebraic modelling system. We present preliminary results of numerical experiments with well-known nonsmooth optimization test problems. We also compare the proposed algorithm with the algorithm that uses the exponential smoothing function as well as with the algorithm based on nonlinear programming reformulation of the finite minimax problem. 相似文献
9.
The circular cone programming (CCP) problem is to minimize or maximize a linear function over the intersection of an affine space with the Cartesian product of circular cones. In this paper, we study nondegeneracy and strict complementarity for the CCP, and present a nonmonotone smoothing Newton method for solving the CCP. We reformulate the CCP as a second-order cone programming (SOCP) problem using the algebraic relation between the circular cone and the second-order cone. Then based on a one parametric class of smoothing functions for the SOCP, a smoothing Newton method is developed for the CCP by adopting a new nonmonotone line search scheme. Without restrictions regarding its starting point, our algorithm solves one linear system of equations approximately and performs one line search at each iteration. Under mild assumptions, our algorithm is shown to possess global and local quadratic convergence properties. Some preliminary numerical results illustrate that our nonmonotone smoothing Newton method is promising for solving the CCP. 相似文献
10.
WU Jia & ZHANG LiWei School of Mathematical Sciences Dalian University of Technology Dalian China 《中国科学 数学(英文版)》2011,(6)
We consider a class of mathematical programs governed by parameterized quasi-variational inequalities(QVI).The necessary optimality conditions for the optimization problem with QVI constraints are reformulated as a system of nonsmooth equations under the linear independence constraint qualification and the strict slackness condition.A set of second order sufficient conditions for the mathematical program with parameterized QVI constraints are proposed,which are demonstrated to be sufficient for the second o... 相似文献
11.
We propose a class of parametric smooth functions that approximate the fundamental plus function, (x)+=max{0, x}, by twice integrating a probability density function. This leads to classes of smooth parametric nonlinear equation approximations of nonlinear and mixed complementarity problems (NCPs and MCPs). For any solvable NCP or MCP, existence of an arbitrarily accurate solution to the smooth nonlinear equations as well as the NCP or MCP, is established for sufficiently large value of a smoothing parameter . Newton-based algorithms are proposed for the smooth problem. For strongly monotone NCPs, global convergence and local quadratic convergence are established. For solvable monotone NCPs, each accumulation point of the proposed algorithms solves the smooth problem. Exact solutions of our smooth nonlinear equation for various values of the parameter , generate an interior path, which is different from the central path for interior point method. Computational results for 52 test problems compare favorably with these for another Newton-based method. The smooth technique is capable of solving efficiently the test problems solved by Dirkse and Ferris [6], Harker and Xiao [11] and Pang & Gabriel [28].This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grant CCR-9322479. 相似文献
12.
In this paper, we introduce a new class of smoothing functions, which include some popular smoothing complementarity functions. We show that the new smoothing functions possess a system of favorite properties. The existence and continuity of a smooth path for solving the nonlinear complementarity problem (NCP) with a P 0 function are discussed. The Jacobian consistency of this class of smoothing functions is analyzed. Based on the new smoothing functions, we investigate a smoothing Newton algorithm for the NCP and discuss its global and local superlinear convergence. Some preliminary numerical results are reported. 相似文献
13.
14.
A new smoothing quasi-Newton method for nonlinear complementarity problems is presented. The method is a generalization of Thomas’ method for smooth nonlinear systems and has similar properties as Broyden's method. Local convergence is analyzed for a strictly complementary solution as well as for a degenerate solution. Presented numerical results demonstrate quite similar behavior of Thomas’ and Broyden's methods. 相似文献
15.
In this paper, we introduce a one-parametric class of smoothing functions, which enjoys some favourable properties and includes two famous smoothing functions as special cases. Based on this class of smoothing functions, we propose a regularization Newton method for solving the non-linear complementarity problem. The main feature of the proposed method is that it uses a perturbed Newton equation to obtain the direction. This not only allows our method to have global and local quadratic convergences without strict complementarity conditions, but also makes the regularization parameter converge to zero globally Q-linearly. In addition, we use a new non-monotone line search scheme to obtain the step size. Some numerical results are reported which confirm the good theoretical properties of the proposed method. 相似文献
16.
17.
Jingyong Tang Guoping HeLi Dong Liang Fang 《Applied mathematics and computation》2011,218(4):1317-1329
A new smoothing function is given in this paper by smoothing the symmetric perturbed Fischer-Burmeister function. Based on this new smoothing function, we present a smoothing Newton method for solving the second-order cone optimization (SOCO). The method solves only one linear system of equations and performs only one line search at each iteration. Without requiring strict complementarity assumption at the SOCO solution, the proposed algorithm is shown to be globally and locally quadratically convergent. Numerical results demonstrate that our algorithm is promising and comparable to interior-point methods. 相似文献
18.
Emilio Musso Lorenzo Nicolodi 《Transactions of the American Mathematical Society》1996,348(11):4321-4337
We consider the variational problem defined by the functional on immersed surfaces in Euclidean space. Using the invariance of the functional under the group of Laguerre transformations, we study the extremal surfaces by the method of moving frames.
19.
20.
Liu YangYanping Chen Xiaojiao TongChunlin Deng 《Applied mathematics and computation》2011,217(24):9855-9863
In this paper, a new smoothing Newton method is proposed for solving constrained nonlinear equations. We first transform the constrained nonlinear equations to a system of semismooth equations by using the so-called absolute value function of the slack variables, and then present a new smoothing Newton method for solving the semismooth equations by constructing a new smoothing approximation function. This new method is globally and quadratically convergent. It needs to solve only one system of unconstrained equations and to perform one line search at each iteration. Numerical results show that the new algorithm works quite well. 相似文献