全文获取类型
收费全文 | 7988篇 |
免费 | 220篇 |
国内免费 | 160篇 |
专业分类
化学 | 194篇 |
晶体学 | 1篇 |
力学 | 231篇 |
综合类 | 66篇 |
数学 | 7648篇 |
物理学 | 228篇 |
出版年
2023年 | 37篇 |
2022年 | 69篇 |
2021年 | 88篇 |
2020年 | 88篇 |
2019年 | 100篇 |
2018年 | 111篇 |
2017年 | 130篇 |
2016年 | 121篇 |
2015年 | 106篇 |
2014年 | 330篇 |
2013年 | 396篇 |
2012年 | 420篇 |
2011年 | 320篇 |
2010年 | 325篇 |
2009年 | 502篇 |
2008年 | 530篇 |
2007年 | 526篇 |
2006年 | 348篇 |
2005年 | 329篇 |
2004年 | 253篇 |
2003年 | 232篇 |
2002年 | 242篇 |
2001年 | 213篇 |
2000年 | 238篇 |
1999年 | 190篇 |
1998年 | 165篇 |
1997年 | 157篇 |
1996年 | 188篇 |
1995年 | 175篇 |
1994年 | 125篇 |
1993年 | 130篇 |
1992年 | 127篇 |
1991年 | 117篇 |
1990年 | 94篇 |
1989年 | 65篇 |
1988年 | 85篇 |
1987年 | 57篇 |
1986年 | 84篇 |
1985年 | 113篇 |
1984年 | 81篇 |
1983年 | 23篇 |
1982年 | 55篇 |
1981年 | 41篇 |
1980年 | 40篇 |
1979年 | 33篇 |
1978年 | 55篇 |
1977年 | 47篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8368条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
M. M. Kostreva 《Journal of Optimization Theory and Applications》1989,62(1):63-76
Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments. 相似文献
5.
An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines 总被引:2,自引:0,他引:2
Luca Zanni 《Computational Management Science》2006,3(2):131-145
In this paper we propose some improvements to a recent decomposition technique for the large quadratic program arising in
training support vector machines. As standard decomposition approaches, the technique we consider is based on the idea to
optimize, at each iteration, a subset of the variables through the solution of a quadratic programming subproblem. The innovative
features of this approach consist in using a very effective gradient projection method for the inner subproblems and a special
rule for selecting the variables to be optimized at each step. These features allow to obtain promising performance by decomposing
the problem into few large subproblems instead of many small subproblems as usually done by other decomposition schemes. We
improve this technique by introducing a new inner solver and a simple strategy for reducing the computational cost of each
iteration. We evaluate the effectiveness of these improvements by solving large-scale benchmark problems and by comparison
with a widely used decomposition package. 相似文献
6.
Dean A. Carlson 《Journal of Mathematical Analysis and Applications》2002,276(2):561-588
The method of equivalent variational methods, originally due to Carathéodory for free problems in the calculus of variations is extended to investigate feedback Nash equilibria for a class of n-person differential games. Both the finite-horizon and infinite-horizon cases are considered. Examples are given to illustrate the presented results. 相似文献
7.
Mikhail Andramonov 《Journal of Global Optimization》2002,24(2):115-132
We consider applications of disjunctive programming to global optimization and problems with equilibrium constraints. We propose a modification of the algorithm of F. Beaumont for disjunctive programming problems and show its numerical efficiency. 相似文献
8.
Boban Marinković 《Mathematical Methods of Operations Research》2006,63(3):513-524
We present local sensitivity analysis for discrete optimal control problems with varying endpoints in the case when the customary regularity of boundary conditions can be violated. We study the behavior of the optimal solutions subject to parametric perturbations of the problem. 相似文献
9.
We consider the problem of maximizing a linear fractional function on the Pareto efficient frontier of two other linear fractional functions. We present a finite pivoting-type algorithm that solves the maximization problem while computing simultaneously the efficient frontier. Application to multistage efficiency analysis is discussed. An example demonstrating the computational procedure is included. 相似文献
10.
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program,
are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting
planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost
non-existent.
In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general
mixed-integer programs are also discussed. 相似文献