全文获取类型
收费全文 | 78篇 |
免费 | 2篇 |
国内免费 | 2篇 |
专业分类
化学 | 4篇 |
力学 | 1篇 |
综合类 | 2篇 |
数学 | 74篇 |
物理学 | 1篇 |
出版年
2023年 | 2篇 |
2022年 | 3篇 |
2021年 | 2篇 |
2018年 | 3篇 |
2016年 | 2篇 |
2014年 | 3篇 |
2013年 | 2篇 |
2012年 | 3篇 |
2011年 | 4篇 |
2009年 | 5篇 |
2008年 | 4篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 2篇 |
2004年 | 1篇 |
2003年 | 2篇 |
2002年 | 2篇 |
2001年 | 2篇 |
2000年 | 1篇 |
1999年 | 2篇 |
1998年 | 2篇 |
1997年 | 5篇 |
1996年 | 3篇 |
1995年 | 3篇 |
1994年 | 2篇 |
1993年 | 1篇 |
1985年 | 1篇 |
1983年 | 1篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1978年 | 1篇 |
1977年 | 1篇 |
排序方式: 共有82条查询结果,搜索用时 15 毫秒
11.
In this paper, we show that every convex semi-infinite vector optimization (CSVO for brevity) problem can be arbitrarily approximated by stable CSVO problems, i.e., the set of all stable CSVO problems (the weak solution map is continuous or the solution map is upper semicontinuous) is dense in the set of all CSVO problems with the given topology. 相似文献
12.
Rudolf Berghammer Agnieszka Rusinowska Harrie de Swart 《European Journal of Operational Research》2007
We present an application of relational algebra to coalition formation. This leads to specifications, which can be executed with the help of the RelView tool after a simple translation into the tool’s programming language. As an example we consider a simplification of the situation in Poland after the 2001 elections. 相似文献
13.
Suppose that it is possible to integrate real functions over a weak base theory related to polynomial time computability. Does it follow that we can count? The answer seems to be: obviously yes! We try to convince the reader that the severe restrictions on induction in feasible theories preclude a straightforward answer. Nevertheless, a more sophisticated reflection does indeed show that the answer is affirmative. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim) 相似文献
14.
《Operations Research Letters》2022,50(5):517-523
This paper develops and studies a feasible directions approach for the minimization of a continuous function over linear constraints in which the update directions belong to a predetermined finite set spanning the feasible set. These directions are recurrently investigated in a cyclic semi-random order, where the stepsize of the update is determined via univariate optimization. We establish that any accumulation point of this optimization procedure is a stationary point of the problem, meaning that the directional derivative in any feasible direction is nonnegative. To assess and establish a rate of convergence, we develop a new optimality measure that acts as a proxy for the stationarity condition, and substantiate its role by showing that it is coherent with first-order conditions in specific scenarios. Finally we prove that our method enjoys a sublinear rate of convergence of this optimality measure in expectation. 相似文献
15.
为了能够设计合理的单点浮筒主尺度,归纳提出了悬链式单点浮筒5条主要设计原则.基于实际工程经验给出了浮筒重量的母型预估方法,探讨储备浮力,提出等干舷方案集,基于静力学原理和水动力分析探讨了浮筒的自由漂浮稳性及浮筒的运动响应,梳理了垂荡及摇摆随浮筒直径的变化规律.以25 m和100 m水深的浮筒直径上限和下限为边界建立可行域,分别以三个实际项目采纳的浮筒直径和45 m水深下单点浮筒直径的可行范围为参考,开展浮筒直径可行域的验证.研究表明:环境条件等不同因素也会引起相同水深下浮筒直径可行域的变化,因此在可行域的实际应用中应进一步考虑一定的偏差裕量.该文的可行域研究对于悬链式单点浮筒的主尺度确定具有积极的指导意义. 相似文献
16.
Csilla Bujtás 《Discrete Mathematics》2009,309(22):6391-6401
A color-bounded hypergraph is a hypergraph (set system) with vertex set X and edge set E={E1,…,Em}, together with integers si and ti (1≤si≤ti≤|Ei|) for i=1,…,m. A vertex coloring φ is feasible if the number of colors occurring in edge Ei satisfies si≤|φ(Ei)|≤ti, for every i≤m.In this paper we point out that hypertrees-hypergraphs admitting a representation over a (graph) tree where each hyperedge Ei induces a subtree of the underlying tree-play a central role concerning the set of possible numbers of colors that can occur in feasible colorings. We also consider interval hypergraphs and circular hypergraphs, where the underlying graph is a path or a cycle, respectively. Sufficient conditions are given for a ‘gap-free’ chromatic spectrum; i.e., when each number of colors is feasible between minimum and maximum. The algorithmic complexity of colorability is studied, too.Compared with the ‘mixed hypergraphs’-where ‘D-edge’ means (si,ti)=(2,|Ei|), while ‘C-edge’ assumes (si,ti)=(1,|Ei|−1)-the differences are rather significant. 相似文献
17.
This paper presents several new algorithms, generalizing feasible directions algorithms, for the nonlinear programming problem, min{f
0
(z) f
j
(z) 0,j = 1, 2, ,m}. These new algorithms do not require an initial feasible point. They automatically combine the operations of initialization (phase I) and optimization (phase II).Research sponsored by the National Science Foundation (RANN) Grant ENV76-04264 and the National Science Foundation Grant ENG73-08214-A01. 相似文献
18.
M. Patriksson 《Journal of Optimization Theory and Applications》1993,78(2):227-246
In this paper, we characterize a class of feasible direction methods in nonlinear programming through the concept of partial linearization of the objective function. Based on a feasible point, the objective is replaced by an arbitrary convex and continuously differentiable function, and the error is taken into account by a first-order approximation of it. A new feasible point is defined through a line search with respect to the original objective, toward the solution of the approximate problem. Global convergence results are given for exact and approximate line searches, and possible interpretations are made. We present some instances of the general algorithm and discuss extensions to nondifferentiable programming.The author wishes to thank Drs. K. Holmberg, T. Larsson, and A. Migdalas for their helpful comments. 相似文献
19.
20.
Cheng-xian Xu Xiao-liang Feng-min Xu 《计算数学(英文版)》2006,24(6):749-760
An effective continuous algorithm is proposed to find approximate solutions of NP-hardmax-cut problems.The algorithm relaxes the max-cut problem into a continuous nonlinearprogramming problem by replacing n discrete constraints in the original problem with onesingle continuous constraint.A feasible direction method is designed to solve the resultingnonlinear programming problem.The method employs only the gradient evaluations ofthe objective function,and no any matrix calculations and no line searches are required.This greatly reduces the calculation cost of the method,and is suitable for the solutionof large size max-cut problems.The convergence properties of the proposed method toKKT points of the nonlinear programming are analyzed.If the solution obtained by theproposed method is a global solution of the nonlinear programming problem,the solutionwill provide an upper bound on the max-cut value.Then an approximate solution to themax-cut problem is generated from the solution of the nonlinear programming and providesa lower bound on the max-cut value.Numerical experiments and comparisons on somemax-cut test problems(small and large size)show that the proposed algorithm is efficientto get the exact solutions for all small test problems and well satisfied solutions for mostof the large size test problems with less calculation costs. 相似文献