全文获取类型
收费全文 | 3427篇 |
免费 | 329篇 |
国内免费 | 326篇 |
学科分类
数理化 | 4082篇 |
出版年
2024年 | 4篇 |
2023年 | 33篇 |
2022年 | 30篇 |
2021年 | 56篇 |
2020年 | 61篇 |
2019年 | 83篇 |
2018年 | 73篇 |
2017年 | 76篇 |
2016年 | 95篇 |
2015年 | 68篇 |
2014年 | 130篇 |
2013年 | 239篇 |
2012年 | 153篇 |
2011年 | 142篇 |
2010年 | 141篇 |
2009年 | 178篇 |
2008年 | 194篇 |
2007年 | 202篇 |
2006年 | 201篇 |
2005年 | 188篇 |
2004年 | 162篇 |
2003年 | 160篇 |
2002年 | 192篇 |
2001年 | 130篇 |
2000年 | 144篇 |
1999年 | 137篇 |
1998年 | 128篇 |
1997年 | 94篇 |
1996年 | 80篇 |
1995年 | 70篇 |
1994年 | 55篇 |
1993年 | 49篇 |
1992年 | 47篇 |
1991年 | 45篇 |
1990年 | 39篇 |
1989年 | 30篇 |
1988年 | 17篇 |
1987年 | 12篇 |
1986年 | 25篇 |
1985年 | 19篇 |
1984年 | 20篇 |
1983年 | 10篇 |
1982年 | 15篇 |
1981年 | 12篇 |
1980年 | 7篇 |
1979年 | 12篇 |
1978年 | 7篇 |
1977年 | 8篇 |
1976年 | 2篇 |
1973年 | 2篇 |
排序方式: 共有4082条查询结果,搜索用时 171 毫秒
101.
R. J. Williams 《Journal of Optimization Theory and Applications》1980,30(4):569-582
Mixed strategy -equilibrium points are given forN-person games with cost functions consisting of quadratic, bilinear, and linear terms and strategy spaces consisting of closed balls in Hilbert spaces. The results are applied to linear-quadratic differential games with no information and quadratic integral constraints on the control functions.This work was supported by a Commonwealth of Australia, Postgraduate Research Award. 相似文献
102.
This paper addresses the problem of stabilizing an uncertain linear system. The uncertaintyq(·) which enters the dynamics is nonstistical in nature. That is, noa priori statistics forq(·) are assumed; only boundsQ on the admissible variations ofq(·) are taken as given. The results given here applied to so-called matched systems differ from previous results in two ways. Firstly, the stabilizing control in this paper is linear; for this same class of problems, many of the existing results would require a nonlinear control. Furthermore, those results which do in fact yield linear controls are only valid when a certain matrix (q) (formed using the given data) is negative definite for allq Q. In contrast, the theory given here only requires compactness of the bounding setQ. Secondly, we show that the so-called matching conditions (used in earlier work) can be generalized so as to encompass a larger class of dynamical systems.This research was supported by the US Department of Energy under Contract No. ET-78-S-01-3390. 相似文献
103.
Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rn1 and Y R
n2 are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010. 相似文献
104.
This paper is concerned with persistency properties which allow the evaluation of some variables at all maximizing points of a quadratic pseudo-Boolean function. Hammer, Hansen and Simeone (1984) have proposed to determine these variables using a procedure described by Balinski for computing a strongly complementary pair of optimal primal and dual solutions for arbitrary linear programs. We propose a linear time algorithm for determining these variables from a best roof off, i.e. from a lowest upper linear bound off. 相似文献
105.
In this paper we propose a recursive quadratic programming algorithm for nonlinear programming problems with inequality constraints that uses as merit function a differentiable exact penalty function. The algorithm incorporates an automatic adjustment rule for the selection of the penalty parameter and makes use of an Armijo-type line search procedure that avoids the need to evaluate second order derivatives of the problem functions. We prove that the algorithm possesses global and superlinear convergence properties. Numerical results are reported. 相似文献
106.
On affine scaling algorithms for nonconvex quadratic programming 总被引:8,自引:0,他引:8
Yinyu Ye 《Mathematical Programming》1992,56(1-3):285-300
We investigate the use of interior algorithms, especially the affine-scaling algorithm, to solve nonconvex — indefinite or negative definite — quadratic programming (QP) problems. Although the nonconvex QP with a polytope constraint is a hard problem, we show that the problem with an ellipsoidal constraint is easy. When the hard QP is solved by successively solving the easy QP, the sequence of points monotonically converge to a feasible point satisfying both the first and the second order optimality conditions.Research supported in part by NSF Grant DDM-8922636 and the College Summer Grant, College of Business Administration, The University of Iowa. 相似文献
107.
Properties of the random search in global optimization 总被引:3,自引:0,他引:3
From theorems which we prove about the behavior of gaps in a set ofN uniformly random points on the interval [0, 1], we determine properties of the random search procedure in one-dimensional global optimization. In particular, we show that the uniform grid search is better than the random search when the optimum is chosen using the deterministic strategy, that a significant proportion of large gaps are contained in the uniformly random search, and that the error in the determination of the point at which the optimum occurs, assuming that it is unique, will on the average be twice as large using the uniformly random search compared with the uniform grid. In addition, some of the properties of the largest gap are verified numerically, and some extensions to higher dimensions are discussed. The latter show that not all of the conclusions derived concerning the inadequacies of the one-dimensional random search extend to higher dimensions, and thaton average the random search is better than the uniform grid for dimensions greater than 6.This paper is based on work started in the Statistics Department of Princeton University when the first author was visiting as a Research Associate. Part of this research was supported by the Office of Naval Research, Contract No. 0014-67-A-0151-0017, and by the US Army Research Office—Durham, Contract No. DA-31-124-ARO-D-215.2 The authors wish to thank B. Omodei for his careful work in preparing the programs for the results of Figs. 1–2 and Table 1. The computations were performed on the IBM 360/50 of the Australian National University's Computer Centre. Thanks are also due to R. Miles for suggestions regarding the extension of the results to multidimensional regions, and to P. A. P. Moran and R. Brent for suggestions regarding the evaluation of the integral
0
1
... 0/1 (x
1
2
+ ... +x
n
/2
)1/2
dx
1 ...dx
n. 相似文献
108.
Symplectic self-adjointness of infinite dimensional Hamiltonian operators is studied, the necessary and sufficient conditions are given. Using the relatively bounded perturbation, the sufficient conditions about symplectic self-adjointness are shown. 相似文献
109.
构造了一个新的locking-free非协调四面体元,研究了单元对三维纯位移弹性问题的一致收敛性,得到了最优的误差估计结果. 相似文献
110.
The performance of an adaptive optics system depends on multiple factors, including the quality of the laser beam before being projected to the mesosphere. In general, cumbersome procedures are required to optimize the laser beam in terms of amplitude and phase. However, aberrations produced by the optics of the laser beam system are still detected during the operations due to, for example, uncertainty in the utilized models. In this paper we propose the use of feedback to overcome the presence of model uncertainty and disturbances. In particular we use a Linear Quadratic Regulator (LQR) for closed loop laser beam shaping using a setup of two deformable mirrors. The proposed method is studied and simulated to provide an automatic optimization of the Amplitude of the laser beam. The performance of the LQR control algorithm is evaluated via numerical simulations using the root mean square error (RMSE). The results show an effective amplitude correction of the laser system aberrations after 20 iterations of the algorithm, a RMSE less than 0.7 was obtained, with about 140 actuators per mirror and a separation of z=3 [m] among the mirrors. 相似文献