全文获取类型
收费全文 | 314篇 |
免费 | 5篇 |
国内免费 | 10篇 |
专业分类
化学 | 33篇 |
力学 | 19篇 |
综合类 | 1篇 |
数学 | 256篇 |
物理学 | 20篇 |
出版年
2022年 | 1篇 |
2021年 | 3篇 |
2020年 | 1篇 |
2019年 | 7篇 |
2018年 | 6篇 |
2017年 | 9篇 |
2016年 | 6篇 |
2015年 | 5篇 |
2014年 | 13篇 |
2013年 | 19篇 |
2012年 | 28篇 |
2011年 | 16篇 |
2010年 | 8篇 |
2009年 | 25篇 |
2008年 | 30篇 |
2007年 | 22篇 |
2006年 | 16篇 |
2005年 | 14篇 |
2004年 | 11篇 |
2003年 | 3篇 |
2002年 | 5篇 |
2001年 | 7篇 |
2000年 | 9篇 |
1999年 | 13篇 |
1998年 | 7篇 |
1997年 | 3篇 |
1996年 | 4篇 |
1995年 | 2篇 |
1994年 | 4篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 2篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 4篇 |
1985年 | 4篇 |
1984年 | 3篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1980年 | 4篇 |
1979年 | 2篇 |
1978年 | 2篇 |
1977年 | 1篇 |
1976年 | 1篇 |
排序方式: 共有329条查询结果,搜索用时 31 毫秒
101.
Fenchel's duality theorem in generalized geometric programming 总被引:1,自引:0,他引:1
E. L. Peterson 《Journal of Optimization Theory and Applications》1978,26(1):51-57
Fenchel's duality theorem is extended to generalized geometric programming with explicit constraints—an extension that also generalizes and strengthens Slater's version of the Kuhn-Tucker theorem.This research was sponsored by the Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant No. AFOSR-73-2516. 相似文献
102.
The paper deals with the feasible setM of a semi-infinite optimization problem, i.e.M is a subset of the finite-dimensional Euclidean space and is basically defined by infinitely many inequality constraints.
Assuming that the extended Mangasarian-Fromovitz constraint qualification holds at all points fromM, it is shown that the quadratic distance function with respect toM is continuously differentiable on an open neighborhood ofM. If, in addition,M is compact, then the set
, which is described by this quadratic distance function, is shown to be an appropriate approximation ofM and the setsM and
can be topologically identified via a homeomorphism. 相似文献
103.
本文提出一个新的约束规格,导出可微多目标规划的有效解的Kuhn-Tucker必要条件,并证明在此条件下,有效解是Kuhn-Tucker真有效解。 相似文献
104.
Oliver Stein 《计算数学(英文版)》2006,24(6):719-732
We study the smoothing method for the solution of generalized semi-infinite optimiza-tion problems from(O.Stein,G.Still:Solving semi-infinite optimization problems withinterior point techniques,SIAM J.Control Optim.,42(2003),pp.769-788).It is shownthat Karush-Kuhn-Tucker points of the smoothed problems do not necessarily converge toa Karush-Kuhn-Tucker point of the original problem,as could be expected from resultsin(F.Facchinei,H.Jiang,L.Qi:A smoothing method for mathematical programs withequilibrium constraints,Math.Program.,85(1999),pp.107-134).Instead, they mightmerely converge to a Fritz John point.We give,however,different additional assumptionswhich guarantee convergence to Karush-Kuhn-Tucker points. 相似文献
105.
91. IntroductionSince the result of monotonic lied theorem of BSDE and its aPPlication to nonlinearDoolyMeyer decomposition theorem, the smallest g-supersolution with a constraint on (Y, Z)(see [1]), some developments have been done, for example, in 14], where by a penallzationmethod, Chen and Peng discussed nonlinear Doob-Meyer decomposition theorem ash theBSDE introduced by Duffie and EPsteinI3]. In [51 Lin discussed the smallest g-supersolutionto BSDE with a constraint on (y,z) wi… 相似文献
106.
We consider a class of two-stage stochastic integer programs and their equivalent reformulation that uses the integer programming value functions in both stages. One class of solution methods in the literature is based on the idea of pre-computing and storing exact value functions, and then exploiting this information within a global branch-and-bound framework. Such methods are known to be very sensitive to the magnitude of feasible right-hand side values. In this note we propose a simple constraint-aggregation based approach that potentially alleviates this limitation. 相似文献
107.
Kristina Meier Elena Herweg Burkhard Schmidt Tobias Klement Lars Regestein Jochen Büchs 《Polymer Testing》2013
Single-use technologies, and thereby polymer materials, are increasingly applied in laboratory and large-scale fermentations. However, little is known about how leaching of polymer additives may affect the culture and compromise GMP regulations. The aim of this study is to introduce a standardized analytical device to test the biocompatibility of such polymer materials. The breathing behavior of various microorganisms was determined with the Respiration Activity MOnitoring Systems (RAMOS) as a function of the added amount of polymer commonly applied in biotechnology. Nylon and polyamide 12, used in cable ties and tubing, respectively, were found to delay and inhibit microbial growth. This is caused by leaching of the plasticizer N-butylbenzenesulfonamide and monomer 1,8-diazacyclotetradecane-2,7-dione, respectively, from the polymers. A metabolic activity inhibition threshold concentration between 4–10 g/L was determined for polyamide 12 tubing. In conclusion, RAMOS is a sensitive and time-effective device to qualify materials before they are applied in cultures. 相似文献
108.
Brian Smith 《General Relativity and Gravitation》2009,41(5):1013-1024
The purpose of this work is to construct asymptotically flat, time symmetric initial data with an apparent horizon of prescribed
intrinsic geometry. To do this, we use the parabolic partial differential equation for prescribing scalar curvature. In this
equation the horizon geometry is contained within the freely specifiable part of the metric. This contrasts with the conformal
method in which the geometry of the horizon can only be specified up to a conformal factor. 相似文献
109.
Christian Léonard 《Journal of Mathematical Analysis and Applications》2008,346(1):183-204
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on the constraint set. Primal attainment, dual equalities, dual attainment and characterizations of the minimizers are obtained with weak constraint qualifications. These results improve several aspects of the literature on the subject. 相似文献
110.
We derive first- and second-order necessary optimality conditions for set-constrained optimization problems under the constraint
qualification-type conditions significantly weaker than Robinson’s constraint qualification. Our development relies on the
so-called 2-regularity concept, and unifies and extends the previous studies based on this concept. Specifically, in our setting
constraints are given by an inclusion, with an arbitrary closed convex set on the right-hand side. Thus, for the second-order
analysis, some curvature characterizations of this set near the reference point must be taken into account.
相似文献