全文获取类型
收费全文 | 11505篇 |
免费 | 83篇 |
国内免费 | 46篇 |
专业分类
化学 | 4731篇 |
晶体学 | 15篇 |
力学 | 695篇 |
数学 | 4025篇 |
物理学 | 2168篇 |
出版年
2024年 | 78篇 |
2023年 | 684篇 |
2022年 | 411篇 |
2021年 | 413篇 |
2020年 | 1458篇 |
2019年 | 1070篇 |
2018年 | 927篇 |
2017年 | 760篇 |
2016年 | 737篇 |
2015年 | 569篇 |
2014年 | 740篇 |
2013年 | 2838篇 |
2012年 | 500篇 |
2011年 | 32篇 |
2010年 | 28篇 |
2009年 | 16篇 |
2008年 | 31篇 |
2007年 | 26篇 |
2006年 | 21篇 |
2005年 | 76篇 |
2004年 | 85篇 |
2003年 | 30篇 |
2002年 | 14篇 |
2001年 | 10篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 9篇 |
1997年 | 3篇 |
1996年 | 3篇 |
1995年 | 1篇 |
1994年 | 2篇 |
1993年 | 4篇 |
1992年 | 1篇 |
1989年 | 1篇 |
1985年 | 2篇 |
1984年 | 4篇 |
1983年 | 4篇 |
1982年 | 4篇 |
1981年 | 10篇 |
1980年 | 3篇 |
1979年 | 4篇 |
1978年 | 6篇 |
1977年 | 6篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1974年 | 3篇 |
1973年 | 2篇 |
排序方式: 共有10000条查询结果,搜索用时 15 毫秒
991.
992.
In this paper, we propose two proximal-gradient algorithms for fractional programming problems in real Hilbert spaces, where the numerator is a proper, convex and lower semicontinuous function and the denominator is a smooth function, either concave or convex. In the iterative schemes, we perform a proximal step with respect to the nonsmooth numerator and a gradient step with respect to the smooth denominator. The algorithm in case of a concave denominator has the particularity that it generates sequences which approach both the (global) optimal solutions set and the optimal objective value of the underlying fractional programming problem. In case of a convex denominator the numerical scheme approaches the set of critical points of the objective function, provided the latter satisfies the Kurdyka-?ojasiewicz property. 相似文献
993.
AbstractCertain notions of approximate weak efficient solutions are considered for a set-valued optimization problem based on vector and set criteria approaches. For approximate solutions based on the vector approach, a characterization is provided in terms of an extended Gerstewitz’s function. For the set approach case, two notions of approximate weak efficient solutions are introduced using a lower and an upper quasi order relations for sets and further compactness and stability aspects are discussed for these approximate solutions. Existence and scalarization using a generalized Gerstewitz’s function are also established for approximate solutions, based on the lower set order relation. 相似文献
994.
M. Hladík 《Optimization》2017,66(3):331-349
We consider a linear regression model where neither regressors nor the dependent variable is observable; only intervals are available which are assumed to cover the unobservable data points. Our task is to compute tight bounds for the residual errors of minimum-norm estimators of regression parameters with various norms (corresponding to least absolute deviations (LAD), ordinary least squares (OLS), generalized least squares (GLS) and Chebyshev approximation). The computation of the error bounds can be formulated as a pair of max–min and min–min box-constrained optimization problems. We give a detailed complexity-theoretic analysis of them. First, we prove that they are NP-hard in general. Then, further analysis explains the sources of NP-hardness. We investigate three restrictions when the problem is solvable in polynomial time: the case when the parameter space is known apriori to be restricted into a particular orthant, the case when the regression model has a fixed number of regression parameters, and the case when only the dependent variable is observed with errors. We propose a method, called orthant decomposition of the parameter space, which is the main tool for obtaining polynomial-time computability results. 相似文献
995.
The Barzilai–Borwein (BB) gradient method has received many studies due to its simplicity and numerical efficiency. By incorporating a nonmonotone line search, Raydan (SIAM J Optim. 1997;7:26–33) has successfully extended the BB gradient method for solving general unconstrained optimization problems so that it is competitive with conjugate gradient methods. However, the numerical results reported by Raydan are poor for very ill-conditioned problems because the effect of the degree of nonmonotonicity may be noticeable. In this paper, we focus more on the nonmonotone line search technique used in the global Barzilai–Borwein (GBB) gradient method. We improve the performance of the GBB gradient method by proposing an adaptive nonmonotone line search based on the morphology of the objective function. We also prove the global convergence and the R-linear convergence rate of the proposed method under reasonable assumptions. Finally, we give some numerical experiments made on a set of unconstrained optimization test problems of the CUTEr collection. The results show the efficiency of the proposed method in the sense of the performance profile introduced (Math Program. 2002;91:201–213) by Dolan and Moré. 相似文献
996.
997.
998.
Debasisha Mishra 《Linear and Multilinear Algebra》2017,65(8):1566-1580
Theory of matrix splittings is a useful tool in the analysis of iterative methods for solving systems of linear equations. When two splittings are given, it is of interest to compare the spectral radii of the corresponding iteration matrices. This helps to arrive at the conclusion that which splitting should one choose so that one can reach the desired solution of accuracy or the exact solution in a faster way. In the case of many splittings are provided, the comparison of the spectral radii is time-consuming. Such a situation can be overcome by introducing another iteration scheme which converges to the same solution of interest in a much faster way. In this direction, the theory of alternating iterations for real rectangular matrices is recently proposed. In this note, some more results to the theory of alternating iterations are added. A comparison result of two different alternating iteration schemes is then presented which will help us to choose the iteration scheme that will guarantee the faster convergence of the alternating iteration scheme. In addition to these results, a comparison result for proper weak regular splittings is also obtained. 相似文献
999.
1000.
Ratikanta Behera 《Linear and Multilinear Algebra》2017,65(8):1662-1682
The notion of the Moore–Penrose inverse of tensors with the Einstein product was introduced, very recently. In this paper, we further elaborate on this theory by producing a few characterizations of different generalized inverses of tensors. A new method to compute the Moore–Penrose inverse of tensors is proposed. Reverse order laws for several generalized inverses of tensors are also presented. In addition to these, we discuss general solutions of multilinear systems of tensors using such theory. 相似文献