全文获取类型
收费全文 | 8510篇 |
免费 | 423篇 |
国内免费 | 533篇 |
专业分类
化学 | 120篇 |
力学 | 535篇 |
综合类 | 87篇 |
数学 | 8257篇 |
物理学 | 467篇 |
出版年
2023年 | 67篇 |
2022年 | 57篇 |
2021年 | 86篇 |
2020年 | 144篇 |
2019年 | 168篇 |
2018年 | 160篇 |
2017年 | 191篇 |
2016年 | 199篇 |
2015年 | 169篇 |
2014年 | 286篇 |
2013年 | 673篇 |
2012年 | 353篇 |
2011年 | 354篇 |
2010年 | 304篇 |
2009年 | 485篇 |
2008年 | 526篇 |
2007年 | 551篇 |
2006年 | 456篇 |
2005年 | 416篇 |
2004年 | 343篇 |
2003年 | 337篇 |
2002年 | 309篇 |
2001年 | 280篇 |
2000年 | 312篇 |
1999年 | 244篇 |
1998年 | 291篇 |
1997年 | 255篇 |
1996年 | 169篇 |
1995年 | 124篇 |
1994年 | 128篇 |
1993年 | 109篇 |
1992年 | 90篇 |
1991年 | 71篇 |
1990年 | 69篇 |
1989年 | 47篇 |
1988年 | 57篇 |
1987年 | 51篇 |
1986年 | 53篇 |
1985年 | 57篇 |
1984年 | 59篇 |
1983年 | 28篇 |
1982年 | 45篇 |
1981年 | 44篇 |
1980年 | 53篇 |
1979年 | 47篇 |
1978年 | 40篇 |
1977年 | 35篇 |
1976年 | 35篇 |
1975年 | 9篇 |
1974年 | 13篇 |
排序方式: 共有9466条查询结果,搜索用时 31 毫秒
31.
The problem of finding the Euclidean distance between two convex polyhedra can be reduced to the combinatorial optimization problem of finding the minimum distance between their faces. This paper presents a global optimality criterion for this problem. An algorithm (QLDPA) for the fast computation of the distance between convex and bounded polyhedra is proposed as an application of it. Computer experiments show its fast performance, especially when the total number of vertices is large. 相似文献
32.
In the present paper we give necessary and sufficient conditions for the subgroup separability of the fundamental group of a finite graph of groups with finitely generated abelian vertex groups.
33.
B. F. Svaiter 《Proceedings of the American Mathematical Society》2003,131(12):3851-3859
Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exists a convex representation of the operator which is a fixed point of this conjugation.
34.
A.R.ELAMROUSS 《数学学报(英文版)》2005,21(1):129-142
This paper contains a generalization of the well-known Palais-Smale and Cerami compactness conditions. The compactness condition introduced is used to prove some general existence theorems for critical points. Some applications are given to differential equations. 相似文献
35.
关于凸曲面的几个定义的关系 总被引:1,自引:0,他引:1
本文讨论了凸曲面的几种定义及其关系,发现有的定义是局部凸的定义,有的是整体凸的定义,有的则对于局部凸和整体凸都适合,最后给出了各种定义之间互推的证明,对于局部凸和整体凸定义之间不能推证的,则说明了原因. 相似文献
36.
Cyclic Hypomonotonicity,Cyclic Submonotonicity,and Integration 总被引:9,自引:1,他引:8
Rockafellar has shown that the subdifferentials of convex functions are always cyclically monotone operators. Moreover, maximal cyclically monotone operators are necessarily operators of this type, since one can construct explicitly a convex function, which turns out to be unique up to a constant, whose subdifferential gives back the operator. This result is a cornerstone in convex analysis and relates tightly convexity and monotonicity. In this paper, we establish analogous robust results that relate weak convexity notions to corresponding notions of weak monotonicity, provided one deals with locally Lipschitz functions and locally bounded operators. In particular, the subdifferentials of locally Lipschitz functions that are directionally hypomonotone [respectively, directionally submonotone] enjoy also an additional cyclic strengthening of this notion and in fact are maximal under this new property. Moreover, every maximal cyclically hypomonotone [respectively, maximal cyclically submonotone] operator is always the Clarke subdifferential of some directionally weakly convex [respectively, directionally approximately convex] locally Lipschitz function, unique up to a constant, which in finite dimentions is a lower C2 function [respectively, a lower C1 function]. 相似文献
37.
A. J. Zaslavski 《Journal of Optimization Theory and Applications》2004,123(3):695-712
In our previous work, a generic well-posedness result (with respect to variations of the integrand of the integral functional) without the convexity condition was established for a class of optimal control problems satisfying the Cesari growth condition. In this paper, we extend this generic well-posedness result to classes of constrained variational problems in which the values at the endpoints and constraint maps are also subject to variations. 相似文献
38.
M. A. Diniz-Ehrhardt M. A. Gomes-Ruggiero J. M. Martínez S. A. Santos 《Journal of Optimization Theory and Applications》2004,123(3):497-517
The spectral projected gradient method SPG is an algorithm for large-scale bound-constrained optimization introduced recently by Birgin, Martínez, and Raydan. It is based on the Raydan unconstrained generalization of the Barzilai-Borwein method for quadratics. The SPG algorithm turned out to be surprisingly effective for solving many large-scale minimization problems with box constraints. Therefore, it is natural to test its perfomance for solving the sub-problems that appear in nonlinear programming methods based on augmented Lagrangians. In this work, augmented Lagrangian methods which use SPG as the underlying convex-constraint solver are introduced (ALSPG) and the methods are tested in two sets of problems. First, a meaningful subset of large-scale nonlinearly constrained problems of the CUTE collection is solved and compared with the perfomance of LANCELOT. Second, a family of location problems in the minimax formulation is solved against the package FFSQP. 相似文献
39.
For vector quasivariational inequalities involving multifunctions in topological vector spaces, an existence result is obtained without a monotonicity assumption and with a convergence assumption weaker than semicontinuity. A new type of quasivariational inequality is proposed. Applications to quasicomplementarity problems and traffic network equilibria are considered. In particular, definitions of weak and strong Wardrop equilibria are introduced for the case of multivalued cost functions. 相似文献
40.
By extracting combinatorial structures in well-solved nonlinear combinatorial optimization problems, Murota (1996,1998) introduced the concepts of M-convexity and L-convexity to functions defined over the integer lattice. Recently, Murota–Shioura (2000, 2001) extended these concepts to polyhedral convex functions and quadratic functions in continuous variables. In this paper, we consider a further extension to more general convex functions defined over the real space, and provide a proof for the conjugacy relationship between general M-convex and L-convex functions.Mathematics Subject Classification (1991): 90C10, 90C25, 90C27, 90C35This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan 相似文献