全文获取类型
收费全文 | 738篇 |
免费 | 54篇 |
国内免费 | 54篇 |
专业分类
化学 | 209篇 |
力学 | 60篇 |
综合类 | 26篇 |
数学 | 388篇 |
物理学 | 163篇 |
出版年
2023年 | 7篇 |
2022年 | 13篇 |
2021年 | 15篇 |
2020年 | 15篇 |
2019年 | 13篇 |
2018年 | 19篇 |
2017年 | 23篇 |
2016年 | 20篇 |
2015年 | 22篇 |
2014年 | 29篇 |
2013年 | 39篇 |
2012年 | 39篇 |
2011年 | 35篇 |
2010年 | 25篇 |
2009年 | 34篇 |
2008年 | 45篇 |
2007年 | 44篇 |
2006年 | 33篇 |
2005年 | 31篇 |
2004年 | 27篇 |
2003年 | 19篇 |
2002年 | 27篇 |
2001年 | 26篇 |
2000年 | 15篇 |
1999年 | 26篇 |
1998年 | 20篇 |
1997年 | 16篇 |
1996年 | 16篇 |
1995年 | 15篇 |
1994年 | 16篇 |
1993年 | 25篇 |
1992年 | 21篇 |
1991年 | 10篇 |
1990年 | 14篇 |
1989年 | 7篇 |
1988年 | 2篇 |
1987年 | 4篇 |
1986年 | 8篇 |
1985年 | 6篇 |
1984年 | 3篇 |
1982年 | 6篇 |
1981年 | 4篇 |
1980年 | 1篇 |
1979年 | 4篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1972年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有846条查询结果,搜索用时 15 毫秒
831.
Constraint qualifications for constrained Lipschitz optimization problems and applications to a MPCC
Three constraint qualifications (the weak generalized Robinson constraint qualification, the bounded constraint qualification, and the generalized Abadie constraint qualification), which are weaker than the generalized Robinson constraint qualification (GRCQ) given by Yen (1997) [1], are introduced for constrained Lipschitz optimization problems. Relationships between those constraint qualifications and the calmness of the solution mapping are investigated. It is demonstrated that the weak generalized Robinson constraint qualification and the bounded constraint qualification are easily verifiable sufficient conditions for the calmness of the solution mapping, whereas the proposed generalized Abadie constraint qualification, described in terms of graphical derivatives in variational analysis, is weaker than the calmness of the solution mapping. Finally, those constraint qualifications are written for a mathematical program with complementarity constraints (MPCC), and new constraint qualifications ensuring the C-stationary point condition of a MPCC are obtained. 相似文献
832.
In cost allocation problem, traditional DEA approaches allocate the fixed cost among a group of decision making units (DMUs), and treat the allocated cost as an extra input of each DMU. If costs except for the fixed cost are regarded as inputs in the cost allocation problem, then it is obvious that the fixed cost is a complement of other inputs rather than an extra independent input. Therefore it is necessary to combine the allocated cost with other cost measures in cost allocation problem. Based on this observation, this paper investigates the relationship between the allocated cost and the DEA efficiency score and develops a DEA-based approach to allocate the fixed cost among various DMUs. An example of allocating advertising expenditure between a car manufacturer and its dealers is presented to illustrate the method proposed in this paper. 相似文献
833.
We consider a class of optimization problems with switch-off/switch-on constraints, which is a relatively new problem model.
The specificity of this model is that it contains constraints that are being imposed (switched on) at some points of the feasible
region, while being disregarded (switched off) at other points. This seems to be a potentially useful modeling paradigm, that
has been shown to be helpful, for example, in optimal topology design. The fact that some constraints “vanish” from the problem
at certain points, gave rise to the name of mathematical programs with vanishing constraints (MPVC). It turns out that such
problems are usually degenerate at a solution, but are structurally different from the related class of mathematical programs
with complementarity constraints (MPCC). In this paper, we first discuss some known first- and second-order necessary optimality
conditions for MPVC, giving new very short and direct justifications. We then derive some new special second-order sufficient
optimality conditions for these problems and show that, quite remarkably, these conditions are actually equivalent to the
classical/standard second-order sufficient conditions in optimization. We also provide a sensitivity analysis for MPVC. Finally,
a relaxation method is proposed. For this method, we analyze constraints regularity and boundedness of the Lagrange multipliers
in the relaxed subproblems, derive a sufficient condition for local uniqueness of solutions of subproblems, and give convergence
estimates.
Research of the first author was supported by the Russian Foundation for Basic Research Grants 07-01-00270, 07-01-00416 and
07-01-90102-Mong, and by RF President’s Grant NS-9344.2006.1 for the support of leading scientific schools. The second author
was supported in part by CNPq Grants 301508/2005-4, 490200/2005-2 and 550317/2005-8, by PRONEX-Optimization, and by FAPERJ. 相似文献
834.
To properly describe and solve complex decision problems, research on theoretical properties and solution of mixed-integer quadratic programs is becoming very important. We establish in this paper different Lipschitz-type continuity results about the optimal value function and optimal solutions of mixed-integer parametric quadratic programs with parameters in the linear part of the objective function and in the right-hand sides of the linear constraints. The obtained results extend some existing results for continuous quadratic programs, and, more importantly, lay the foundation for further theoretical study and corresponding algorithm analysis on mixed-integer quadratic programs. 相似文献
835.
Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ease of solution of the resulting problem. In this note we show how linear equality constraints may be used together with graph theoretic tools to reduce a bilinear program, i.e., eliminate variables from quadratic terms to minimize the number of complicating variables. The method is illustrated on an example. Computer results are reported on known test problems. 相似文献
836.
介绍了用Java Applet程序在网页上制作静态图片的水中倒影的总体实现方案,详细说明了其中涉及的主要技术和方法,也提出了有待解决的几个问题。 相似文献
837.
本文对不等式优化问题提出了一个修正的序列二次规划算法(SQP).该算法适用于退化问题一积极约束梯度线性相关且严格互补条件不成立,并且算法是可行的,具有整体收敛与超线性收敛性. 相似文献
838.
欧阳梓祥 《高等学校计算数学学报》2001,23(1):87-92
n人有限博弈的混合策略组合(p1^*,…,pn^*)为Nash均衡,如果其中每一策略pi^*都是参与人i(i=1,2,…,n),对其它n-1个参与人策略组合(p1^*,…,pi 1^*,pi-1^*,…,pn^*)的最优反应,即存在n个概率向量p1^*,…,pn^*使得对i=1,2,…,n及任意k1维概率向量pi恒有vi(p1^*,…,pn^*…)小于vi(pi^*,…,pi-1^*,pi 1^*,…pn^*),其中vi为参与人i的支付函数,pi=(pil,…,piki))为ki维概率向量,即满足条件,pij大于等于0,∑kij=1pij=1,ki是参与人i的策略空间中策略个数,i=1,2,…,n,由此,Nash均衡的求解可化为下列优化问题:求n个概率向量pi^*,…,pn^8,使得对i=1,2,…,n及任意ki维的概率向量pi满足maxxvi(P1^*,…,pi-1^*,pi,Pi 1^*,…,pn^*)=vi(P1^*,,…,Pn^*)。 相似文献
839.
X. Q. Yang 《Journal of Global Optimization》2004,30(2):271-284
Second-order optimality conditions are studied for the constrained optimization problem where the objective function and the constraints are compositions of convex functions and twice strictly differentiable functions. A second-order sufficient condition of a global minimizer is obtained by introducing a generalized representation condition. Second-order minimizer characterizations for a convex program and a linear fractional program are derived using the generalized representation condition 相似文献
840.
本文考虑共享单车迁移问题, 它可看作是经典旅行售货商问题的一个新颖变形, 不同的是其目标函数为最小化碳排放。其中, 碳排放利用单车负载与其行驶路程的乘积进行刻画。我们提出了两个启发式算法:贪心和基于TSP的算法, 每个算法的核心思想均是优先减少单车负载。从理论上证明算法的可行性并给出数据实验以验证算法的实际性能。数据实验结果表明贪心算法优于基于TSP的算法, 这为共享单车企业进行日常单车分配提供了理论依据。 相似文献