首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   671篇
  国内免费   15篇
  完全免费   12篇
  数学   698篇
  2019年   3篇
  2018年   3篇
  2017年   2篇
  2016年   5篇
  2014年   14篇
  2013年   9篇
  2012年   17篇
  2011年   20篇
  2010年   20篇
  2009年   21篇
  2008年   36篇
  2007年   44篇
  2006年   25篇
  2005年   24篇
  2004年   23篇
  2003年   18篇
  2002年   28篇
  2001年   13篇
  2000年   23篇
  1999年   20篇
  1998年   20篇
  1997年   14篇
  1996年   14篇
  1995年   20篇
  1994年   19篇
  1993年   12篇
  1992年   16篇
  1991年   9篇
  1990年   12篇
  1989年   12篇
  1988年   12篇
  1987年   15篇
  1986年   25篇
  1985年   9篇
  1984年   5篇
  1983年   5篇
  1982年   7篇
  1981年   12篇
  1980年   17篇
  1979年   13篇
  1978年   21篇
  1977年   21篇
  1976年   11篇
  1975年   4篇
  1974年   5篇
排序方式: 共有698条查询结果,搜索用时 151 毫秒
1.
Nonlinear programming without a penalty function   总被引:52,自引:0,他引:52  
In this paper the solution of nonlinear programming problems by a Sequential Quadratic Programming (SQP) trust-region algorithm is considered. The aim of the present work is to promote global convergence without the need to use a penalty function. Instead, a new concept of a “filter” is introduced which allows a step to be accepted if it reduces either the objective function or the constraint violation function. Numerical tests on a wide range of test problems are very encouraging and the new algorithm compares favourably with LANCELOT and an implementation of Sl1QP. Received: October 17, 1997 / Accepted: August 17, 2000?Published online September 3, 2001  相似文献
2.
A globally convergent method for nonlinear programming   总被引:20,自引:0,他引:20  
Recently developed Newton and quasi-Newton methods for nonlinear programming possess only local convergence properties. Adopting the concept of the damped Newton method in unconstrained optimization, we propose a stepsize procedure to maintain the monotone decrease of an exact penalty function. In so doing, the convergence of the method is globalized.This research was supported in part by the National Science Foundation under Grant No. ENG-75-10486.  相似文献
3.
An outer-approximation algorithm is presented for solving mixed-integer nonlinear programming problems of a particular class. Linearity of the integer (or discrete) variables, and convexity of the nonlinear functions involving continuous variables are the main features in the underlying mathematical structure. Based on principles of decomposition, outer-approximation and relaxation, the proposed algorithm effectively exploits the structure of the problems, and consists of solving an alternating finite sequence of nonlinear programming subproblems and relaxed versions of a mixed-integer linear master program. Convergence and optimality properties of the algorithm are presented, as well as a general discussion on its implementation. Numerical results are reported for several example problems to illustrate the potential of the proposed algorithm for programs in the class addressed in this paper. Finally, a theoretical comparison with generalized Benders decomposition is presented on the lower bounds predicted by the relaxed master programs.  相似文献
4.
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.  相似文献
5.
Finding Global Minima with a Computable Filled Function   总被引:16,自引:0,他引:16  
The Filled Function Method is an approach to finding global minima of multidimensional nonconvex functions. The traditional filled functions have features that may affect the computability when applied to numerical optimization. This paper proposes a new filled function. This function needs only one parameter and does not include exponential terms. Also, the lower bound of weight factor a is usually smaller than that of one previous formulation. Therefore, the proposed new function has better computability than the traditional ones.  相似文献
6.
An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described. It applies sequential quadratic programming techniques to a sequence of barrier problems, and uses trust regions to ensure the robustness of the iteration and to allow the direct use of second order derivatives. This framework permits primal and primal-dual steps, but the paper focuses on the primal version of the new algorithm. An analysis of the convergence properties of this method is presented. Received: May 1996 / Accepted: August 18, 2000?Published online October 18, 2000  相似文献
7.
Bilevel programming: A survey   总被引:14,自引:0,他引:14  
This paper provides an introductory survey of a class of optimization problems known as bilevel programming. We motivate this class through a simple application, and then proceed with the general formulation of bilevel programs. We consider various cases (linear, linear-quadratic, nonlinear), describe their main properties and give an overview of solution approaches.Received: April 2005, Revised: May 2005, AMS classification: 90C05, 90C11, 90C20, 90C27, 90C3D, 65K05  相似文献
8.
An Interior-Point Algorithm for Nonconvex Nonlinear Programming   总被引:11,自引:0,他引:11  
The paper describes an interior-point algorithm for nonconvex nonlinear programming which is a direct extension of interior-point methods for linear and quadratic programming. Major modifications include a merit function and an altered search direction to ensure that a descent direction for the merit function is obtained. Preliminary numerical testing indicates that the method is robust. Further, numerical comparisons with MINOS and LANCELOT show that the method is efficient, and has the promise of greatly reducing solution times on at least some classes of models.  相似文献
9.
Reliability-Based Optimization of structural systems   总被引:10,自引:0,他引:10  
A method to carry out a Reliability-Based Optimization (RBO) of especially nonlinear structural systems is introduced. Statistical uncertainties involving both structural and loading properties are considered. The concept is based on the separation of structural reliability analyses and the optimization procedures. Two approaches are discussed, depending on the interaction of reliability analysis and mathematical programming and the way of representation of the limit state functions (LSF) of the structure. As, for cases of practical significance, the LSF is known only pointwise it is approximated by Response Surfaces (RS). For the response calculations Finite Element (FE) procedures are utilized. Failure probabilities are determined by applying variance reducing Monte Carlo simulation (MCS) techniques such as Importance Sampling (IS). Following the reliability analysis, the optimization procedure is controlled by the NLPQL algorithm. A numerical example in terms of a template ocean platform exemplifies the procedures.Formerly Institute of Engineering Mechanics, Leopold-Franzens-University, Innsbruck, Austria  相似文献
10.
A continuation method for monotone variational inequalities   总被引:9,自引:0,他引:9  
This paper presents a continuation method for monotone variational inequality problems based on a new smooth equation formulation. The existence, uniqueness and limiting behavior of the path generated by the method are analyzed.This work was supported by the National Science Foundation Presidential Young Investigator Award ECE-8552773 and by a grant from the Burlington Northern Railroad.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号