全文获取类型

收费全文 |
496篇 |

国内免费 |
7篇 |

完全免费 |
11篇 |

专业分类

数学 |
514篇 |

出版年

2020年 |
1篇 |

2019年 |
2篇 |

2018年 |
26篇 |

2017年 |
10篇 |

2016年 |
15篇 |

2015年 |
14篇 |

2014年 |
24篇 |

2013年 |
18篇 |

2012年 |
12篇 |

2011年 |
22篇 |

2010年 |
25篇 |

2009年 |
15篇 |

2008年 |
26篇 |

2007年 |
19篇 |

2006年 |
10篇 |

2005年 |
11篇 |

2004年 |
17篇 |

2003年 |
15篇 |

2002年 |
9篇 |

2001年 |
14篇 |

2000年 |
10篇 |

1999年 |
14篇 |

1998年 |
12篇 |

1997年 |
5篇 |

1996年 |
19篇 |

1995年 |
9篇 |

1994年 |
14篇 |

1993年 |
16篇 |

1992年 |
8篇 |

1991年 |
12篇 |

1990年 |
8篇 |

1989年 |
8篇 |

1988年 |
4篇 |

1987年 |
3篇 |

1986年 |
2篇 |

1984年 |
1篇 |

1982年 |
5篇 |

1981年 |
2篇 |

1980年 |
3篇 |

1978年 |
2篇 |

1977年 |
1篇 |

1976年 |
1篇 |

1974年 |
1篇 |

1972年 |
2篇 |

1971年 |
4篇 |

1969年 |
1篇 |

1968年 |
1篇 |

1964年 |
10篇 |

1963年 |
6篇 |

1962年 |
10篇 |

1961年 |
6篇 |

1959年 |
8篇 |

1953年 |
1篇 |

**排序方式：**共有514条查询结果，搜索用时 93 毫秒

1.

Efficient Global Optimization of Expensive Black-Box Functions

**总被引：23，自引：0，他引：23** Donald R. Jones Matthias Schonlau William J. Welch 《Journal of Global Optimization》1998,13(4):455-492

In many engineering optimization problems, the number of function evaluations is severely limited by time or cost. These problems pose a special challenge to the field of global optimization, since existing methods often require more function evaluations than can be comfortably afforded. One way to address this challenge is to fit response surfaces to data collected by evaluating the objective and constraint functions at a few points. These surfaces can then be used for visualization, tradeoff analysis, and optimization. In this paper, we introduce the reader to a response surface methodology that is especially good at modeling the nonlinear, multimodal functions that often occur in engineering. We then show how these approximating functions can be used to construct an efficient global optimization algorithm with a credible stopping rule. The key to using response surfaces for global optimization lies in balancing the need to exploit the approximating surface (by sampling where it is minimized) with the need to improve the approximation (by sampling where prediction error may be high). Striking this balance requires solving certain auxiliary problems which have previously been considered intractable, but we show how these computational obstacles can be overcome. 相似文献

2.

On the formulation and theory of the Newton interior-point method for nonlinear programming

**总被引：16，自引：0，他引：16** A. S. El-Bakry R. A. Tapia T. Tsuchiya Y. Zhang 《Journal of Optimization Theory and Applications》1996,89(3):507-541

In this work, we first study in detail the formulation of the primal-dual interior-point method for linear programming. We show that, contrary to popular belief, it cannot be viewed as a damped Newton method applied to the Karush-Kuhn-Tucker conditions for the logarithmic barrier function problem. Next, we extend the formulation to general nonlinear programming, and then validate this extension by demonstrating that this algorithm can be implemented so that it is locally and Q-quadratically convergent under only the standard Newton method assumptions. We also establish a global convergence theory for this algorithm and include promising numerical experimentation.The first two authors were supported in part by NSF Cooperative Agreement No. CCR-8809615, by Grants AFOSR 89-0363, DOE DEFG05-86ER25017, ARO 9DAAL03-90-G-0093, and the REDI Foundation. The fourth author was supported in part by NSF DMS-9102761 and DOE DE-FG02-93ER25171. The authors would like to thank Sandra Santos for painstakingly proofreading an earlier verion of this paper. 相似文献

3.

On the admissibility of an estimator of a normal mean vector under a linex loss function

**总被引：7，自引：0，他引：7** Ahmad Parsian 《Annals of the Institute of Statistical Mathematics》1990,42(4):657-669

For a

*p*-variate normal mean with known variances, the model proposed by Zellner (1986,*J. Amer. Statist. Assoc.*,**81**, 446–451) is discussed in a slightly different framework. A generalized Bayes estimate is derived from a three-stage Bayes point of view under the asymmetric loss function, and the admissibility of such estimators is proved. 相似文献4.

Shinji Mizuno 《Mathematical Programming》1994,67(1-3):109-119

Kojima, Megiddo, and Mizuno investigate an infeasible-interior-point algorithm for solving a primal—dual pair of linear programming problems and they demonstrate its global convergence. Their algorithm finds approximate optimal solutions of the pair if both problems have interior points, and they detect infeasibility when the sequence of iterates diverges. Zhang proves polynomial-time convergence of an infeasible-interior-point algorithm under the assumption that both primal and dual problems have feasible points. In this paper, we show that a modification of the Kojima—Megiddo—Mizuno algorithm solves the pair of problems in polynomial time without assuming the existence of the LP solution. Furthermore, we develop an

*O(nL)*-iteration complexity result for a variant of the algorithm.The original title was Polynomiality of the Kojima—Megiddo—Mizuno infeasible-interior-point algorithm for linear programming.Research performed while visiting Cornell University (April 1992 – January 1993) as an Overseas Research Scholar of the Ministry of Science, Education and Culture of Japan. 相似文献5.

Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions

**总被引：5，自引：0，他引：5**In this paper we study primal-dual path-following algorithms for the second-order cone programming (SOCP) based on a family
of directions that is a natural extension of the Monteiro-Zhang (MZ) family for semidefinite programming. We show that the
polynomial iteration-complexity bounds of two well-known algorithms for linear programming, namely the short-step path-following
algorithm of Kojima et al. and Monteiro and Adler, and the predictor-corrector algorithm of Mizuno et al., carry over to the
context of SOCP, that is they have an

*O*( logε^{-1}) iteration-complexity to reduce the duality gap by a factor of ε, where*n*is the number of second-order cones. Since the MZ-type family studied in this paper includes an analogue of the Alizadeh, Haeberly and Overton pure Newton direction, we establish for the first time the polynomial convergence of primal-dual algorithms for SOCP based on this search direction. Received: June 5, 1998 / Accepted: September 8, 1999?Published online April 20, 2000 相似文献6.

Projection method for solving a singular system of linear equations and its applications

**总被引：4，自引：0，他引：4** Kunio Tanabe 《Numerische Mathematik》1971,17(3):203-214

Summary The iterative method for solving system of linear equations, due to Kaczmarz [2], is investigated. It is shown that the method works well for both singular and non-singular systems and it determines the affine space formed by the solutions if they exist. The method also provides an iterative procedure for computing a generalized inverse of a matrix. 相似文献

7.

Portfolio management with stable distributions

**总被引：3，自引：0，他引：3**8.

Joint distributions of numbers of success-runs and failures until the first consecutivek successes

**总被引：3，自引：3，他引：0**Joint distributions of the numbers of failures, successes and success-runs of length less than

*k*until the first consecutive*k*successes are obtained for some random sequences such as a sequence of independent and identically distributed integer valued random variables, a {0, 1}-valued Markov chain and a binary sequence of order*k*. There are some ways of counting numbers of runs with a specified length. This paper studies the joint distributions based on three ways of counting numbers of runs, i.e., the number of overlapping runs with a specified length, the number of non-overlapping runs with a specified length and the number of runs with a specified length or more. Marginal distributions of them can be derived immediately, and most of them are surprisingly simple.This research was partially supported by the ISM Cooperative Research Program (93-ISM-CRP-8). 相似文献9.

Space-Time Point-Process Models for Earthquake Occurrences

**总被引：3，自引：0，他引：3** Yosihiko Ogata 《Annals of the Institute of Statistical Mathematics》1998,50(2):379-402

Several space-time statistical models are constructed based on both classical empirical studies of clustering and some more speculative hypotheses. Then we discuss the discrimination between models incorporating contrasting assumptions concerning the form of the space-time clusters. We also examine further practical extensions of the model to situations where the background seismicity is spatially non-homogeneous, and the clusters are non-isotropic. The goodness-of-fit of the models, as measured by AIC values, is discussed for two high quality data sets, in different tectonic regions. AIC also allows the details of the clustering structure in space to be clarified. A simulation algorithm for the models is provided, and used to confirm the numerical accuracy of the likelihood calculations. The simulated data sets show the similar spatial distributions to the real ones, but differ from them in some features of space-time clustering. These differences may provide useful indicators of directions for further study. 相似文献

10.

Likelihood estimation of soft-core interaction potentials for Gibbsian point patterns

**总被引：3，自引：3，他引：0** Yosihiko Ogata Masaharu Tanemura 《Annals of the Institute of Statistical Mathematics》1989,41(3):583-600

The likelihood method is developed for the analysis of socalled regular point patterns. Approximating the normalizing factor of Gibbs canonical distribution, we simultaneously estimate two parameters, one for the scale and the other which measures the softness (or hardness), of repulsive interactions between points. The approximations are useful up to a considerably high density. Some real data are analyzed to illustrate the utility of the parameters for characterizing the regular point pattern. 相似文献