首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   10646篇
  国内免费   657篇
  完全免费   120篇
  数学   11423篇
  2019年   47篇
  2018年   251篇
  2017年   208篇
  2016年   160篇
  2015年   293篇
  2014年   450篇
  2013年   416篇
  2012年   450篇
  2011年   582篇
  2010年   525篇
  2009年   591篇
  2008年   632篇
  2007年   515篇
  2006年   481篇
  2005年   410篇
  2004年   413篇
  2003年   455篇
  2002年   354篇
  2001年   297篇
  2000年   332篇
  1999年   307篇
  1998年   312篇
  1997年   242篇
  1996年   239篇
  1995年   150篇
  1994年   164篇
  1993年   146篇
  1992年   157篇
  1991年   151篇
  1990年   140篇
  1989年   129篇
  1988年   138篇
  1987年   111篇
  1986年   102篇
  1985年   103篇
  1984年   104篇
  1983年   26篇
  1982年   108篇
  1981年   83篇
  1980年   87篇
  1979年   74篇
  1978年   77篇
  1977年   63篇
  1976年   46篇
  1975年   9篇
  1974年   17篇
  1973年   32篇
  1972年   37篇
  1971年   34篇
  1970年   21篇
  1969年   18篇
  1968年   7篇
  1967年   13篇
  1966年   8篇
  1965年   7篇
  1964年   12篇
  1963年   6篇
  1962年   10篇
  1961年   12篇
  1960年   4篇
  1959年   11篇
  1958年   5篇
  1957年   3篇
  1956年   2篇
  1955年   3篇
  1954年   1篇
  1953年   4篇
  1952年   2篇
  1951年   4篇
  1950年   2篇
  1939年   3篇
  1938年   1篇
  1936年   3篇
  1928年   3篇
  1927年   4篇
  1926年   1篇
  1925年   1篇
  1924年   1篇
  1922年   1篇
排序方式: 共有11423条查询结果,搜索用时 203 毫秒
1.
Whether or not the general asymmetric variational inequality problem can be formulated as a differentiable optimization problem has been an open question. This paper gives an affirmative answer to this question. We provide a new optimization problem formulation of the variational inequality problem, and show that its objective function is continuously differentiable whenever the mapping involved in the latter problem is continuously differentiable. We also show that under appropriate assumptions on the latter mapping, any stationary point of the optimization problem is a global optimal solution, and hence solves the variational inequality problem. We discuss descent methods for solving the equivalent optimization problem and comment on systems of nonlinear equations and nonlinear complementarity problems.  相似文献
2.
Stability analysis of some representative numerical methods for systems of neutral delay-differential equations (NDDEs) is considered. After the establishment of a sufficient condition of asymptotic stability for linear NDDEs, the stability regions of linear multistep, explicit Runge-Kutta and implicitA-stable Runge-Kutta methods are discussed when they are applied to asymptotically stable linear NDDEs. Some mentioning about the extension of the results for the multiple delay case is given.  相似文献
3.
This paper presents a sequential quadratic programming algorithm for computing a stationary point of a mathematical program with linear complementarity constraints. The algorithm is based on a reformulation of the complementarity condition as a system of semismooth equations by means of Fischer-Burmeister functional, combined with a classical penalty function method for solving constrained optimization problems. Global convergence of the algorithm is established under appropriate assumptions. Some preliminary computational results are reported.  相似文献
4.
Weak Convergence Theorems for Nonexpansive Mappings and Monotone Mappings   总被引:18,自引:0,他引:18  
In this paper, we introduce an iteration process of finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a variational inequality problem for an inverse strongly-monotone mapping, and then obtain a weak convergence theorem. Using this result, we obtain a weak convergence theorem for a pair of a nonexpansive mapping and a strictly pseudocontractive mapping. Further, we consider the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse strongly-monotone mapping.  相似文献
5.
This paper presents a sequential quadratic programming algorithm for computing a stationary point of a mathematical program with linear complementarity constraints. The algorithm is based on a reformulation of the complementarity condition as a system of semismooth equations by means of Fischer-Burmeister functional, combined with a classical penalty function method for solving constrained optimization problems. Global convergence of the algorithm is established under appropriate assumptions. Some preliminary computational results are reported.  相似文献
6.
Tilting modules of finite projective dimension   总被引:17,自引:0,他引:17  
7.
A slacks-based measure of efficiency in data envelopment analysis   总被引:17,自引:0,他引:17  
In this paper, we will propose a slacks-based measure (SBM) of efficiency in Data Envelopment Analysis (DEA). This scalar measure deals directly with the input excesses and the output shortfalls of the decision making unit (DMU) concerned. It is units invariant and monotone decreasing with respect to input excess and output shortfall. Furthermore, this measure is determined only by consulting the reference-set of the DMU and is not affected by statistics over the whole data set. The new measure has a close connection with other measures proposed so far, e.g., Charnes–Cooper–Rhodes (CCR), Banker–Charnes–Cooper (BCC) and the Russell measure of efficiency. The dual side of this model can be interpreted as profit maximization, in contrast to the ratio maximization of the CCR model. Numerical experiments show its validity as an efficiency measurement tool and its compatibility with other measures of efficiency.  相似文献
8.
Orthodox semidirect products and wreath products of monoids   总被引:17,自引:0,他引:17  
Communicated by H.-J. Hoehnke  相似文献
9.
In this work, we first study in detail the formulation of the primal-dual interior-point method for linear programming. We show that, contrary to popular belief, it cannot be viewed as a damped Newton method applied to the Karush-Kuhn-Tucker conditions for the logarithmic barrier function problem. Next, we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Q-quadratically convergent under only the standard Newton method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.The first two authors were supported in part by NSF Cooperative Agreement No. CCR-8809615, by Grants AFOSR 89-0363, DOE DEFG05-86ER25017, ARO 9DAAL03-90-G-0093, and the REDI Foundation. The fourth author was supported in part by NSF DMS-9102761 and DOE DE-FG02-93ER25171. The authors would like to thank Sandra Santos for painstakingly proofreading an earlier verion of this paper.  相似文献
10.
A note on chance constrained programming with fuzzy coefficients   总被引:16,自引:0,他引:16  
This paper deals with nonlinear chance constrained programming as well as multiobjective case and goal programming with fuzzy coefficients occurring in not only constraints but also objectives. We also present a fuzzy simulation technique for handling fuzzy objective constraints and fuzzy goal constraints. Finally, a fuzzy simulation based genetic algorithm is employed to solve a numerical example.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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