首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4341篇
  国内免费   242篇
  完全免费   313篇
  数学   4896篇
  2022年   1篇
  2021年   10篇
  2020年   12篇
  2019年   64篇
  2018年   81篇
  2017年   73篇
  2016年   85篇
  2015年   67篇
  2014年   118篇
  2013年   245篇
  2012年   297篇
  2011年   200篇
  2010年   178篇
  2009年   295篇
  2008年   324篇
  2007年   328篇
  2006年   287篇
  2005年   233篇
  2004年   202篇
  2003年   180篇
  2002年   167篇
  2001年   159篇
  2000年   172篇
  1999年   143篇
  1998年   148篇
  1997年   164篇
  1996年   97篇
  1995年   85篇
  1994年   77篇
  1993年   59篇
  1992年   52篇
  1991年   41篇
  1990年   38篇
  1989年   11篇
  1988年   24篇
  1987年   23篇
  1986年   13篇
  1985年   15篇
  1984年   16篇
  1983年   8篇
  1982年   20篇
  1981年   15篇
  1980年   20篇
  1979年   7篇
  1978年   15篇
  1977年   10篇
  1976年   9篇
  1975年   2篇
  1974年   5篇
  1972年   1篇
排序方式: 共有4896条查询结果,搜索用时 203 毫秒
1.
B-vex functions   总被引:37,自引:0,他引:37  
A class of functions, called b-vex functions, is introduced by relaxing the definition of convexity of a function. Both the differentiable and nondifferentiable cases are presented. Members of this class satisfy most of the basic properties of convex functions. This class forms a subset of the sets of both semistrictly quasiconvex as well as quasiconvex functions, but are not necessarily included in the class of preinvex functions.The first author is thankful to the Natural Science and Engineering Research Council of Canada for financial support through Grant A-5319. The authors are also grateful to an anonymous referee for the constructive criticism of the first version of the paper, to Dr. Collen Knickerbocker of St. Lawrence University, and to Mrs. Meena K. Bector for their help in sharpening Examples 2.1 and 2.2, respectively.  相似文献
2.
混合单调算子的不动点存在唯一性定理及其应用   总被引:37,自引:0,他引:37       下载免费PDF全文
吴焱生  李国祯 《数学学报》2003,46(1):161-166
本文首先讨论了一类混合单调算子方程组解的存在唯一性及非对称迭代逼近问题,得到了若干不具有连续性和紧性条件的有关混合单调算子、增算子和减算子的新不动点定理.其次研究了具有a-凹和-a-凸的不具有连续性和紧性条件的混合单调算子的不动点,并得到了一个新结果.最后,我们将所得结果应用于RN上的Hammerstein积分方程之中(参见文[1-12]).  相似文献
3.
E-Convex Sets, E-Convex Functions, and E-Convex Programming   总被引:33,自引:0,他引:33  
A class of sets and a class of functions called E-convex sets and E-convex functions are introduced by relaxing the definitions of convex sets and convex functions. This kind of generalized convexity is based on the effect of an operator E on the sets and domain of definition of the functions. The optimality results for E-convex programming problems are established.  相似文献
4.
An Iterative Approach to Quadratic Optimization   总被引:30,自引:0,他引:30  
Assume that C 1, . . . , C N are N closed convex subsets of a real Hilbert space H having a nonempty intersection C. Assume also that each C i is the fixed point set of a nonexpansive mapping T i of H. We devise an iterative algorithm which generates a sequence (x n ) from an arbitrary initial x 0H. The sequence (xn) is shown to converge in norm to the unique solution of the quadratic minimization problem min xC (1/2)Ax, xx, u, where A is a bounded linear strongly positive operator on H and u is a given point in H. Quadratic–quadratic minimization problems are also discussed.  相似文献
5.
二阶非线性常微分方程的正周期解   总被引:29,自引:0,他引:29       下载免费PDF全文
李永祥 《数学学报》2002,45(3):481-488
本文应用Krasnoselskii锥映射不动点定理,研究了二阶非线性常微分方程的ω-周期解的存在性,获得了若干正ω-周期解的存在性与多重性结果.  相似文献
6.
Smoothing methods for convex inequalities and linear complementarity problems   总被引:27,自引:0,他引:27  
A smooth approximationp (x, ) to the plus function max{x, 0} is obtained by integrating the sigmoid function 1/(1 + ex ), commonly used in neural networks. By means of this approximation, linear and convex inequalities are converted into smooth, convex unconstrained minimization problems, the solution of which approximates the solution of the original problem to a high degree of accuracy for sufficiently large. In the special case when a Slater constraint qualification is satisfied, an exact solution can be obtained for finite. Speedup over MINOS 5.4 was as high as 1142 times for linear inequalities of size 2000 × 1000, and 580 times for convex inequalities with 400 variables. Linear complementarity problems are converted into a system of smooth nonlinear equations and are solved by a quadratically convergent Newton method. For monotone LCPs with as many as 10 000 variables, the proposed approach was as much as 63 times faster than Lemke's method.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9101801 and CCR-9322479.  相似文献
7.
In this paper, we present sufficient optimality conditions and duality results for a class of nonlinear fractional programming problems. Our results are based on the properties of sublinear functionals and generalized convex functions.  相似文献
8.
Contingent epiderivatives and set-valued optimization   总被引:24,自引:0,他引:24  
In this paper we introduce the concept of the contingent epiderivative for a set-valued map which modifies a notion introduced by Aubin [2] as upper contingent derivative. It is shown that this kind of a derivative has important properties and is one possible generalization of directional derivatives in the single-valued convex case. For optimization problems with a set-valued objective function optimality conditions based on the concept of the contingent epiderivative are proved which are necessary and sufficient under suitable assumptions.  相似文献
9.
一类减算子的不动点定理及其应用   总被引:23,自引:0,他引:23       下载免费PDF全文
本文研究了一类具有凹凸性的减算子,给出了这种减算子的不动点的存在性、唯一性和迭代收敛性的一个新的结果,而且在几种方程中得到了应用.  相似文献
10.
Proper efficiency with respect to cones   总被引:21,自引:0,他引:21  
Strict separation by a cone is used here to redefine proper efficiency. Two versions of the properness, which unify and generalize known definitions, are presented. Necessary and sufficient conditions for the existence of the set of properly efficient decisions and characterization of this set in terms of the supports of the decision set are given.The research was done while the author was a visiting professor at the University of British Columbia, Vancouver, British Columbia, Canada.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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