全文获取类型
收费全文 | 7998篇 |
免费 | 240篇 |
国内免费 | 174篇 |
专业分类
化学 | 189篇 |
晶体学 | 1篇 |
力学 | 303篇 |
综合类 | 80篇 |
数学 | 7468篇 |
物理学 | 371篇 |
出版年
2023年 | 28篇 |
2022年 | 74篇 |
2021年 | 85篇 |
2020年 | 84篇 |
2019年 | 97篇 |
2018年 | 104篇 |
2017年 | 148篇 |
2016年 | 150篇 |
2015年 | 112篇 |
2014年 | 337篇 |
2013年 | 363篇 |
2012年 | 440篇 |
2011年 | 331篇 |
2010年 | 342篇 |
2009年 | 491篇 |
2008年 | 530篇 |
2007年 | 546篇 |
2006年 | 355篇 |
2005年 | 330篇 |
2004年 | 249篇 |
2003年 | 242篇 |
2002年 | 246篇 |
2001年 | 212篇 |
2000年 | 235篇 |
1999年 | 194篇 |
1998年 | 172篇 |
1997年 | 156篇 |
1996年 | 180篇 |
1995年 | 175篇 |
1994年 | 120篇 |
1993年 | 127篇 |
1992年 | 127篇 |
1991年 | 115篇 |
1990年 | 97篇 |
1989年 | 69篇 |
1988年 | 85篇 |
1987年 | 53篇 |
1986年 | 83篇 |
1985年 | 115篇 |
1984年 | 76篇 |
1983年 | 26篇 |
1982年 | 47篇 |
1981年 | 40篇 |
1980年 | 34篇 |
1979年 | 29篇 |
1978年 | 48篇 |
1977年 | 47篇 |
1976年 | 27篇 |
1975年 | 12篇 |
1974年 | 12篇 |
排序方式: 共有8412条查询结果,搜索用时 15 毫秒
41.
多目标半定规划的互补弱鞍点和G-鞍点最优性条件 总被引:1,自引:0,他引:1
对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题,给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义.然后,在较弱的凸性条件下,利用含矩阵和向量约束的择一性定理,建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件. 相似文献
42.
43.
通过对非线性规划问题的K-T点的光滑路径跟踪方法研究,得出一种针对于既有不等式约束条件又有等式约束条件的优化问题光滑路径跟踪方法,证明了光滑跟踪路径的存在性。 相似文献
44.
本文给出多目标规划有效解适应鞍点准则的一个新的判别法 ,它不使用凸性的几何术语及凸分析中的概念。最后给出单目标规划的一个相应的判别法 相似文献
45.
S. Al-Homidan 《Journal of Optimization Theory and Applications》2007,135(3):583-598
Given a data matrix, we find its nearest symmetric positive-semidefinite Toeplitz matrix. In this paper, we formulate the
problem as an optimization problem with a quadratic objective function and semidefinite constraints. In particular, instead
of solving the so-called normal equations, our algorithm eliminates the linear feasibility equations from the start to maintain
exact primal and dual feasibility during the course of the algorithm. Subsequently, the search direction is found using an
inexact Gauss-Newton method rather than a Newton method on a symmetrized system and is computed using a diagonal preconditioned
conjugate-gradient-type method. Computational results illustrate the robustness of the algorithm. 相似文献
46.
René Meziat Diego Patiño Pablo Pedregal 《Computational Optimization and Applications》2007,38(1):147-171
We propose an alternative method for computing effectively the solution of non-linear, fixed-terminal-time, optimal control
problems when they are given in Lagrange, Bolza or Mayer forms. This method works well when the nonlinearities in the control
variable can be expressed as polynomials. The essential of this proposal is the transformation of a non-linear, non-convex
optimal control problem into an equivalent optimal control problem with linear and convex structure. The method is based on
global optimization of polynomials by the method of moments. With this method we can determine either the existence or lacking
of minimizers. In addition, we can calculate generalized solutions when the original problem lacks of minimizers. We also
present the numerical schemes to solve several examples arising in science and technology. 相似文献
47.
A review of the optimal stopping problem with more than a single decision maker (DM) is presented in this paper. We classify
the existing literature according to the arrival of the offers, the utility of the DMs, the length of the sequence of offers,
the nature of the game and the number of offers to be selected. We enumerate various definitions for this problem and describe
some dynamic approaches.
Fouad Ben Abdelaziz is on leave from the Institut Superieur de Gestion, University of Tunis, Tunisia e-mail: foued.benabdelaz@isg.run.tn. 相似文献
48.
In this note we show that many classes of global optimization problems can be treated most satisfactorily by classical optimization theory and conventional algorithms. We focus on the class of problems involving the minimization of the product of several convex functions on a convex set which was studied recently by Kunoet al. [3]. It is shown that these problems are typical composite concave programming problems and thus can be handled elegantly by c-programming [4]–[8] and its techniques. 相似文献
49.
A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems 总被引:3,自引:0,他引:3
Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal
with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these
difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration
algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing
costs. Numerical example is given to demonstrate the validity of the present algorithm.
The project supported by the Machinary and Electronics Ministry of China 相似文献
50.
Dashan Huang Yoshitaka Kai Frank J. Fabozzi Masao Fukushima 《European Journal of Operational Research》2007
This paper presents a model for optimally designing a collateralized mortgage obligation (CMO) with a planned amortization class (PAC)-companion structure using dynamic cash reserve. In this structure, the mortgage pool’s cash flow is allocated by rule to the two bond classes such that PAC bondholders receive substantial prepayment protection, that protection being provided by the companion bondholders. The structure we propose provides greater protection to the PAC bondholders than current structures during periods of rising interest rates when this class of bondholders faces greater extension risk. We do so by allowing a portion of the cash flow from the collateral to be reserved to meet the PAC’s scheduled cash flow in subsequent periods. The greater protection is provided by the companion bondholders exposure to interest loss. To tackle this problem, we transform the problem of designing the optimal PAC-companion structure into a standard stochastic linear programming problem which can be solved efficiently. Moreover, we present an extended model by considering the quality of the companion bond and by relaxing the PAC bondholder shortfall constraint. Based on numerical experiments through Monte Carlo simulation, we show the utility of the proposed model. 相似文献