全文获取类型
收费全文 | 195篇 |
免费 | 5篇 |
国内免费 | 12篇 |
专业分类
化学 | 3篇 |
力学 | 3篇 |
综合类 | 3篇 |
数学 | 183篇 |
物理学 | 20篇 |
出版年
2024年 | 1篇 |
2023年 | 3篇 |
2022年 | 2篇 |
2021年 | 3篇 |
2020年 | 2篇 |
2019年 | 4篇 |
2018年 | 7篇 |
2017年 | 4篇 |
2016年 | 5篇 |
2015年 | 2篇 |
2014年 | 5篇 |
2013年 | 15篇 |
2012年 | 7篇 |
2011年 | 3篇 |
2010年 | 5篇 |
2009年 | 10篇 |
2008年 | 11篇 |
2007年 | 11篇 |
2006年 | 7篇 |
2005年 | 6篇 |
2004年 | 12篇 |
2003年 | 11篇 |
2002年 | 8篇 |
2001年 | 6篇 |
2000年 | 9篇 |
1999年 | 9篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 2篇 |
1995年 | 2篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1991年 | 1篇 |
1990年 | 1篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 1篇 |
1983年 | 1篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1980年 | 2篇 |
1978年 | 4篇 |
1976年 | 1篇 |
1975年 | 1篇 |
1973年 | 1篇 |
排序方式: 共有212条查询结果,搜索用时 15 毫秒
1.
利用标量化方法建立对称向量拟均衡问题有效解的存在性定理。作为标量化方法的应用,利用这一方法得到向量变分不等式和拟向量变分不等式有效解的存在性定理。 相似文献
2.
Ji-Ming Peng 《Mathematical Programming》1997,78(3):347-355
In this paper we propose a class of merit functions for variational inequality problems (VI). Through these merit functions,
the variational inequality problem is cast as unconstrained minimization problem. We estimate the growth rate of these merit
functions and give conditions under which the stationary points of these functions are the solutions of VI.
This work was supported by the state key project “Scientific and Engineering Computing”. 相似文献
3.
Lihong Wang 《Annals of the Institute of Statistical Mathematics》2004,56(2):251-264
The purpose of this paper is to investigate the asymptotic properties of the least squares estimates (L
2-estimates) and the least absolute deviation estimates (L
1-estimates) of the parameters of a nonlinear regression model subject to a set of equality and inequality restrictions, which
has a long-range dependent stationary process as its stochastic errors. Then we will compare the asymptotic relative efficiencies
of the above estimators. 相似文献
4.
In this paper, we investigate a constrained optimization problem with a quadratic cost functional and two quadratic equality constraints. It is assumed that the cost functional is positive definite and that the constraints are both feasible and regular (but otherwise they are unrestricted quadratic functions). Thus, the existence of a global constrained minimum is assured. We develop a necessary and sufficient condition that completely characterizes the global minimum cost. Such a condition is of essential importance in iterative numerical methods for solving the constrained minimization problem, because it readily distinguishes between local minima and global minima and thus provides a stopping criterion for the computation. The result is similar to one obtained previously by the authors. In the previous result, we gave a characterization of the global minimum of a constrained quadratic minimization problem in which the cost functional was an arbitrary quadratic functional (as opposed to positive-definite here) and the constraints were at least positive-semidefinite quadratic functions (as opposed to essentially unrestricted here). 相似文献
5.
G.J. Zalmai Qing-hong Zhang 《应用数学学报(英文版)》2007,23(2):217-234
In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem. 相似文献
6.
We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004 相似文献
7.
§ 1 IntroductionConsiderthefollowingnonlinearoptimizationproblem :minimizef(x)subjecttoC(x) =0 , a≤x≤b ,( 1 .1 )wheref(x) :Rn→R ,C(x) =(c1(x) ,c2 (x) ,...,cm(x) ) T:Rn→Rm aretwicecontinuouslydifferentiable,m≤n ,a ,b∈Rn.Trustregionalgorithmsareveryeffectiveforsolvingnonlinearoptimi… 相似文献
8.
The paper addresses bivariate surface fitting problems, where data points lie on the vertices of a rectangular grid. Efficient
and stable algorithms can be found in the literature to solve such problems. If data values are missing at some grid points,
there exists a computational method for finding a least squares spline by fixing appropriate values for the missing data.
We extended this technique to arbitrary least squares problems as well as to linear least squares problems with linear equality
constraints. Numerical examples are given to show the effectiveness of the technique presented.
AMS subject classification (2000) 65D05, 65D07, 65D10, 65F05, 65F20 相似文献
9.
The constrained optimization problem with a quadratic cost functional and two quadratic equality constraints has been studied by Bar-on and Grasse, with positive-definite matrix in the objective. In this note, we shall relax the matrix in the objective to be positive semidefinite. A necessary and sufficient condition to characterize a local optimal solution to be global is established. Also, a perturbation scheme is proposed to solve this generalized problem. 相似文献
10.
B. Rustem 《Journal of Optimization Theory and Applications》1993,76(3):429-453
In this paper, we consider two algorithms for nonlinear equality and inequality constrained optimization. Both algorithms utilize stepsize strategies based on differentiable penalty functions and quadratic programming subproblems. The essential difference between the algorithms is in the stepsize strategies used. The objective function in the quadratic subproblem includes a linear term that is dependent on the penalty functions. The quadratic objective function utilizes an approximate Hessian of the Lagrangian augmented by the penalty functions. In this approximation, it is possible to ignore the second-derivative terms arising from the constraints in the penalty functions.The penalty parameter is determined using a strategy, slightly different for each algorithm, that ensures boundedness as well as a descent property. In particular, the boundedness follows as the strategy is always satisfied for finite values of the parameter.These properties are utilized to establish global convergence and the condition under which unit stepsizes are achieved. There is also a compatibility between the quadratic objective function and the stepsize strategy to ensure the consistency of the properties for unit steps and subsequent convergence rates.This research was funded by SERC and ESRC research contracts. The author is grateful to Professors Laurence Dixon and David Mayne for their comments. The numerical results in the paper were obtained using a program written by Mr. Robin Becker. 相似文献