首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   637篇
  国内免费   24篇
  完全免费   39篇
  数学   700篇
  2021年   1篇
  2020年   2篇
  2019年   3篇
  2018年   6篇
  2017年   11篇
  2016年   9篇
  2015年   6篇
  2014年   15篇
  2013年   22篇
  2012年   35篇
  2011年   25篇
  2010年   36篇
  2009年   34篇
  2008年   40篇
  2007年   28篇
  2006年   31篇
  2005年   26篇
  2004年   22篇
  2003年   32篇
  2002年   43篇
  2001年   22篇
  2000年   26篇
  1999年   21篇
  1998年   24篇
  1997年   21篇
  1996年   16篇
  1995年   12篇
  1994年   11篇
  1993年   16篇
  1992年   14篇
  1991年   7篇
  1990年   12篇
  1989年   8篇
  1988年   10篇
  1987年   2篇
  1986年   6篇
  1985年   5篇
  1984年   5篇
  1983年   1篇
  1982年   6篇
  1981年   6篇
  1980年   2篇
  1979年   5篇
  1978年   8篇
  1977年   5篇
  1976年   1篇
  1971年   1篇
排序方式: 共有700条查询结果,搜索用时 171 毫秒
1.
A nonsmooth version of Newton's method   总被引:69,自引:0,他引:69  
Newton's method for solving a nonlinear equation of several variables is extended to a nonsmooth case by using the generalized Jacobian instead of the derivative. This extension includes the B-derivative version of Newton's method as a special case. Convergence theorems are proved under the condition of semismoothness. It is shown that the gradient function of the augmented Lagrangian forC 2-nonlinear programming is semismooth. Thus, the extended Newton's method can be used in the augmented Lagrangian method for solving nonlinear programs.This author's work is supported in part by the Australian Research Council.This author's work is supported in part by the National Science Foundation under grant DDM-8721709.  相似文献
2.
On the limited memory BFGS method for large scale optimization   总被引:60,自引:0,他引:60  
We study the numerical performance of a limited memory quasi-Newton method for large scale optimization, which we call the L-BFGS method. We compare its performance with that of the method developed by Buckley and LeNir (1985), which combines cycles of BFGS steps and conjugate direction steps. Our numerical tests indicate that the L-BFGS method is faster than the method of Buckley and LeNir, and is better able to use additional storage to accelerate convergence. We show that the L-BFGS method can be greatly accelerated by means of a simple scaling. We then compare the L-BFGS method with the partitioned quasi-Newton method of Griewank and Toint (1982a). The results show that, for some problems, the partitioned quasi-Newton method is clearly superior to the L-BFGS method. However we find that for other problems the L-BFGS method is very competitive due to its low iteration cost. We also study the convergence properties of the L-BFGS method, and prove global convergence on uniformly convex problems.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contract DE-FG02-87ER25047, and by National Science Foundation Grant No. DCR-86-02071.  相似文献
3.
对牛顿迭代法的一个重要修改   总被引:26,自引:0,他引:26  
对解非线性和超越方程f(x)=0的牛顿迭代法作了重要的改进·利用动力系统的李雅普诺夫方法,构造了新的“牛顿类”方法·这些新的迭代方法保持了牛顿法的收敛速率和计算效能,摒弃了强加于f(x)的单调性要求f′(x)≠0·  相似文献
4.
The smoothing Newton method for solving a system of nonsmooth equations , which may arise from the nonlinear complementarity problem, the variational inequality problem or other problems, can be regarded as a variant of the smoothing method. At the th step, the nonsmooth function is approximated by a smooth function , and the derivative of at is used as the Newton iterative matrix. The merits of smoothing methods and smoothing Newton methods are global convergence and convenience in handling. In this paper, we show that the smoothing Newton method is also superlinearly convergent if is semismooth at the solution and satisfies a Jacobian consistency property. We show that most common smooth functions, such as the Gabriel-Moré function, have this property. As an application, we show that for box constrained variational inequalities if the involved function is -uniform, the iteration sequence generated by the smoothing Newton method will converge to the unique solution of the problem globally and superlinearly (quadratically).

  相似文献

5.
The paper deals with complementarity problems CP(F), where the underlying functionF is assumed to be locally Lipschitzian. Based on a special equivalent reformulation of CP(F) as a system of equationsφ(x)=0 or as the problem of minimizing the merit functionΘ=1/2∥Φ2 2 , we extend results which hold for sufficiently smooth functionsF to the nonsmooth case. In particular, ifF is monotone in a neighbourhood ofx, it is proved that 0 εδθ(x) is necessary and sufficient forx to be a solution of CP(F). Moreover, for monotone functionsF, a simple derivative-free algorithm that reducesΘ is shown to possess global convergence properties. Finally, the local behaviour of a generalized Newton method is analyzed. To this end, the result by Mifflin that the composition of semismooth functions is again semismooth is extended top-order semismooth functions. Under a suitable regularity condition and ifF isp-order semismooth the generalized Newton method is shown to be locally well defined and superlinearly convergent with the order of 1+p.  相似文献
6.
In this paper we take a new look at smoothing Newton methods for solving the nonlinear complementarity problem (NCP) and the box constrained variational inequalities (BVI). Instead of using an infinite sequence of smoothing approximation functions, we use a single smoothing approximation function and Robinson’s normal equation to reformulate NCP and BVI as an equivalent nonsmooth equation H(u,x)=0, where H:ℜ 2n →ℜ 2n , u∈ℜ n is a parameter variable and x∈ℜ n is the original variable. The central idea of our smoothing Newton methods is that we construct a sequence {z k =(u k ,x k )} such that the mapping H(·) is continuously differentiable at each z k and may be non-differentiable at the limiting point of {z k }. We prove that three most often used Gabriel-Moré smoothing functions can generate strongly semismooth functions, which play a fundamental role in establishing superlinear and quadratic convergence of our new smoothing Newton methods. We do not require any function value of F or its derivative value outside the feasible region while at each step we only solve a linear system of equations and if we choose a certain smoothing function only a reduced form needs to be solved. Preliminary numerical results show that the proposed methods for particularly chosen smoothing functions are very promising. Received June 23, 1997 / Revised version received July 29, 1999?Published online December 15, 1999  相似文献
7.
A new algorithm for the solation of large-scale nonlinear complementarity problems is introduced. The algorithm is based on a nonsmooth equation reformulation of the complementarity problem and on an inexact Levenberg-Marquardt-type algorithm for its solution. Under mild assumptions, and requiring only the approximate solution of a linear system at each iteration, the algorithm is shown to be both globally and superlinearly convergent, even on degenerate problems. Numerical results for problems with up to 10 000 variables are presented. Partially supported by Agenzia Spaziale Italiana, Roma, Italy.  相似文献
8.
一类非拟Newton算法及其收敛性   总被引:14,自引:0,他引:14  
本文对求解无约束最优化问题提出一类非拟Newton算法,此方法同样具有二次终止性,产生的矩阵序列保持正定对称传递性,并证明了新类中的任何一种算法的全局收敛和超线性收敛性。  相似文献
9.
Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.  相似文献
10.
二次锥规划的光滑牛顿法   总被引:13,自引:0,他引:13  
在光滑Fischer-Burmeister函数的基础上,本文给出了二次锥规划的一种新的光滑牛顿法.该方法所采用的系统不是等价于中心路径条件,而是等价于最优性条件本身.算法对初始点没有任何限制,且具有Q-二阶收敛速度.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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