全文获取类型
收费全文 | 467篇 |
免费 | 9篇 |
国内免费 | 14篇 |
专业分类
化学 | 48篇 |
力学 | 15篇 |
数学 | 376篇 |
物理学 | 51篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 4篇 |
2020年 | 7篇 |
2019年 | 6篇 |
2018年 | 7篇 |
2017年 | 8篇 |
2016年 | 4篇 |
2015年 | 5篇 |
2014年 | 24篇 |
2013年 | 40篇 |
2012年 | 28篇 |
2011年 | 31篇 |
2010年 | 15篇 |
2009年 | 37篇 |
2008年 | 40篇 |
2007年 | 29篇 |
2006年 | 20篇 |
2005年 | 23篇 |
2004年 | 16篇 |
2003年 | 11篇 |
2002年 | 7篇 |
2001年 | 9篇 |
2000年 | 11篇 |
1999年 | 10篇 |
1998年 | 2篇 |
1997年 | 4篇 |
1996年 | 9篇 |
1995年 | 7篇 |
1994年 | 4篇 |
1993年 | 6篇 |
1992年 | 9篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 1篇 |
1988年 | 2篇 |
1987年 | 2篇 |
1986年 | 2篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1982年 | 3篇 |
1981年 | 2篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 4篇 |
1977年 | 1篇 |
排序方式: 共有490条查询结果,搜索用时 500 毫秒
1.
We consider the problem of minimizing an SC1 function subject to inequality constraints. We propose a local algorithm whose distinguishing features are that: (a) a fast convergence rate is achieved under reasonable assumptions that do not include strict complementarity at the solution; (b) the solution of only linear systems is required at each iteration; (c) all the points generated are feasible. After analyzing a basic Newton algorithm, we propose some variants aimed at reducing the computational costs and, in particular, we consider a quasi-Newton version of the algorithm. 相似文献
2.
We consider a Bolza optimal control problem with state constraints. It is well known that under some technical assumptions every strong local minimizer of this problem satisfies first order necessary optimality conditions in the form of a constrained maximum principle. In general, the maximum principle may be abnormal or even degenerate and so does not provide a sufficient information about optimal controls. In the recent literature some sufficient conditions were proposed to guarantee that at least one maximum principle is nondegenerate, cf. [A.V. Arutyanov, S.M. Aseev, Investigation of the degeneracy phenomenon of the maximum principle for optimal control problems with state constraints, SIAM J. Control Optim. 35 (1997) 930–952; F. Rampazzo, R.B. Vinter, A theorem on existence of neighbouring trajectories satisfying a state constraint, with applications to optimal control, IMA 16 (4) (1999) 335–351; F. Rampazzo, R.B. Vinter, Degenerate optimal control problems with state constraints, SIAM J. Control Optim. 39 (4) (2000) 989–1007]. Our aim is to show that actually conditions of a similar nature guarantee normality of every nondegenerate maximum principle. In particular we allow the initial condition to be fixed and the state constraints to be nonsmooth. To prove normality we use J. Yorke type linearization of control systems and show the existence of a solution to a linearized control system satisfying new state constraints defined, in turn, by linearization of the original set of constraints along an extremal trajectory. 相似文献
3.
Adam B. Levy 《Mathematical Programming》2007,110(3):615-639
Numerical methods for solving constrained optimization problems need to incorporate the constraints in a manner that satisfies
essentially competing interests; the incorporation needs to be simple enough that the solution method is tractable, yet complex
enough to ensure the validity of the ultimate solution. We introduce a framework for constraint incorporation that identifies
a minimal acceptable level of complexity and defines two basic types of constraint incorporation which (with combinations)
cover nearly all popular numerical methods for constrained optimization, including trust region methods, penalty methods,
barrier methods, penalty-multiplier methods, and sequential quadratic programming methods. The broad application of our framework
relies on addition and chain rules for constraint incorporation which we develop here. 相似文献
4.
Dirk P. Kroese Sergey Porotsky Reuven Y. Rubinstein 《Methodology and Computing in Applied Probability》2006,8(3):383-407
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In
this paper we consider the cross-entropy method in the context of continuous optimization. We demonstrate the effectiveness
of the cross-entropy method for solving difficult continuous multi-extremal optimization problems, including those with non-linear
constraints.
相似文献
5.
In this paper, we continue the analysis of the image regularity condition (IRC) as introduced in a previous paper where we have proved that IRC implies the existence of generalized Lagrange-John multipliers with first component equal to 1. The term generalized is connected with the fact that the separation (in the image space) is not necessarily linear (when we have classic Lagrange-John multipliers), but it can be also nonlinear. Here, we prove that the IRC guarantees, also in the nondifferentiable case, the fact that 0 is a solution of the first-order homogeneized (linearized) problem obtained by means of the Dini-Hadamard derivatives. 相似文献
6.
Eitan Altman 《Mathematical Methods of Operations Research》1993,37(2):151-170
We present in this paper several asymptotic properties of constrained Markov Decision Processes (MDPs) with a countable state space. We treat both the discounted and the expected average cost, with unbounded cost. We are interested in (1) the convergence of finite horizon MDPs to the infinite horizon MDP, (2) convergence of MDPs with a truncated state space to the problem with infinite state space, (3) convergence of MDPs as the discount factor goes to a limit. In all these cases we establish the convergence of optimal values and policies. Moreover, based on the optimal policy for the limiting problem, we construct policies which are almost optimal for the other (approximating) problems. Based on the convergence of MDPs with a truncated state space to the problem with infinite state space, we show that an optimal stationary policy exists such that the number of randomisations it uses is less or equal to the number of constraints plus one. We finally apply the results to a dynamic scheduling problem.This work was partially supported by the Chateaubriand fellowship from the French embassy in Israel and by the European Grant BRA-QMIPS of CEC DG XIII 相似文献
7.
We study the convergence properties of reduced Hessian successive quadratic programming for equality constrained optimization. The method uses a backtracking line search, and updates an approximation to the reduced Hessian of the Lagrangian by means of the BFGS formula. Two merit functions are considered for the line search: the
1 function and the Fletcher exact penalty function. We give conditions under which local and superlinear convergence is obtained, and also prove a global convergence result. The analysis allows the initial reduced Hessian approximation to be any positive definite matrix, and does not assume that the iterates converge, or that the matrices are bounded. The effects of a second order correction step, a watchdog procedure and of the choice of null space basis are considered. This work can be seen as an extension to reduced Hessian methods of the well known results of Powell (1976) for unconstrained optimization.This author was supported, in part, by National Science Foundation grant CCR-8702403, Air Force Office of Scientific Research grant AFOSR-85-0251, and Army Research Office contract DAAL03-88-K-0086.This author was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under contracts W-31-109-Eng-38 and DE FG02-87ER25047, and by National Science Foundation Grant No. DCR-86-02071. 相似文献
8.
1,3-Dipolar cycloaddition of acrylamide with the cyclic nitrone derived from proline tert-butyl ester has been employed in the synthesis of bicyclic Gly-(s-cis)Pro isosteres suitably protected for the Fmoc-based solid phase peptide synthesis. (R)-1-Phenylethylamine was introduced as chiral auxiliary to resolve racemic intermediates and obtain enantiopure compounds. Using methacrylamide as dipolarophile, the analogous Ala-Pro mimetics have been prepared in racemic form, whereas the same strategy applied to methyl itaconate failed to give the corresponding Asp-Pro mimetic. 相似文献
9.
In order to study the influence of the side-chain orientation on the peptide backbone conformation we have synthesised the model dipeptides t-BuCO-l-Pro-(1S,2R)-c6Phe-NHMe and t-BuCO-l-Pro-(1R,2S)-c6Phe-NHMe, incorporating each enantiomer of the trans cyclohexane analogue of phenylalanine (trans-1-amino-2-phenylcyclohexanecarboxylic acid). The orientation of the aromatic side-chain determines the β-turn type accommodated by these peptides to the point that the (1S,2R)-c6Phe derivative retains the type I β-turn in the crystalline state, in contrast to the behaviour exhibited by the natural counterpart t-BuCO-l-Pro-l-Phe-NHMe. 相似文献
10.
Extrapolated Smoothing Descent Algorithm for Constrained Nonconvex and Nonsmooth Composite Problems*
In this paper, the authors propose a novel smoothing descent type algorithm with extrapolation for solving a class of constrained nonsmooth and nonconvex problems,where the nonconvex term is possibly nonsmooth. Their algorithm adopts the proximal gradient algorithm with extrapolation and a safe-guarding policy to minimize the smoothed objective function for better practical and theoretical performance. Moreover, the algorithm uses a easily checking rule to update the smoothing parameter to ensure that any accumulation point of the generated sequence is an (affine-scaled) Clarke stationary point of the original nonsmooth and nonconvex problem. Their experimental results indicate the effectiveness of the proposed algorithm. 相似文献