首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   147篇
  国内免费   3篇
  完全免费   4篇
  数学   154篇
  2018年   5篇
  2013年   1篇
  2012年   3篇
  2011年   1篇
  2010年   6篇
  2009年   9篇
  2008年   9篇
  2007年   8篇
  2006年   3篇
  2005年   5篇
  2004年   4篇
  2003年   9篇
  2002年   6篇
  2001年   5篇
  2000年   9篇
  1999年   6篇
  1998年   6篇
  1997年   4篇
  1996年   7篇
  1995年   10篇
  1994年   4篇
  1993年   5篇
  1992年   1篇
  1991年   4篇
  1990年   4篇
  1989年   3篇
  1988年   2篇
  1987年   2篇
  1986年   2篇
  1985年   4篇
  1984年   3篇
  1982年   2篇
  1980年   1篇
  1977年   1篇
排序方式: 共有154条查询结果,搜索用时 156 毫秒
1.
In the first part of this paper, the Demyanov difference of two sets is considered. An expression for the Demyanov difference of two sets, which are the convex hulls of a finite number of points, is presented. In the second part, first-order necessary optimality conditions of the Lagrange multiplier type, for quasidifferentiable optimization with equality and inequality constraints, are given by means of the Demyanov difference of subdifferential and negative superdifferential.  相似文献
2.
This paper discusses some properties of trust region algorithms for nonsmooth optimization. The problem is expressed as the minimization of a functionh(f(x), whereh(·) is convex andf is a continuously differentiable mapping from ℝ″ to ℝ‴. Bounds for the second order derivative approximation matrices are discussed. It is shown that Powel’s [7, 8] results hold for nonsmooth optimization.  相似文献
3.
In this paper we consider heuristic algorithms for a special case of the generalized bilevel mathematical programming problem in which one of the levels is represented as a variational inequality problem. Such problems arise in network design and economic planning. We obtain derivative information needed to implement these algorithms for such bilevel problems from the theory of sensitivity analysis for variational inequalities. We provide computational results for several numerical examples.  相似文献
4.
We present an approach for the solution of a class of generalized semi-infinite optimization problems. Our approach uses augmented Lagrangians to transform generalized semi-infinite min-max problems into ordinary semi-infinite min-max problems, with the same set of local and global solutions as well as the same stationary points. Once the transformation is effected, the generalized semi-infinite min-max problems can be solved using any available semi-infinite optimization algorithm. We illustrate our approach with two numerical examples, one of which deals with structural design subject to reliability constraints.  相似文献
5.
It is proved that the second order correction trust region algorithm of Fletcher [5] ensures superlinear convergence if some mild conditions are satisfied.  相似文献
6.
New Bundle Methods for Solving Lagrangian Relaxation Dual Problems   总被引:5,自引:0,他引:5  
Bundle methods have been used frequently to solve nonsmooth optimization problems. In these methods, subgradient directions from past iterations are accumulated in a bundle, and a trial direction is obtained by performing quadratic programming based on the information contained in the bundle. A line search is then performed along the trial direction, generating a serious step if the function value is improved by or a null step otherwise. Bundle methods have been used to maximize the nonsmooth dual function in Lagrangian relaxation for integer optimization problems, where the subgradients are obtained by minimizing the performance index of the relaxed problem. This paper improves bundle methods by making good use of near-minimum solutions that are obtained while solving the relaxed problem. The bundle information is thus enriched, leading to better search directions and less number of null steps. Furthermore, a simplified bundle method is developed, where a fuzzy rule is used to combine linearly directions from near-minimum solutions, replacing quadratic programming and line search. When the simplified bundle method is specialized to an important class of problems where the relaxed problem can be solved by using dynamic programming, fuzzy dynamic programming is developed to obtain efficiently near-optimal solutions and their weights for the linear combination. This method is then applied to job shop scheduling problems, leading to better performance than previously reported in the literature.  相似文献
7.
The purpose of this paper is to derive, in a unified way, second order necessary and sufficient optimality criteria, for four types of nonsmooth minimization problems: thediscrete minimax problem, thediscrete l 1-approximation, the minimization of theexact penalty function and the minimization of theclassical exterior penalty function. Our results correct and supplement conditions obtained by various authors in recent papers.  相似文献
8.
A new version of an interactive NIMBUS method for nondifferentiable multiobjective optimization is described. It is based on the reference point idea and the classification of the objective functions. The original problem is transformed into a single objective form according to the classification information. NIMBUS has been designed especially to be able to handle complicated real-life problems in a user-friendly way.The NIMBUS method is used for solving an optimal control problem related to the continuous casting of steel. The main goal is to minimize the defects in the final product. Conflicting objective functions are constructed according to certain metallurgical criteria and some technological constraints. Due to the phase changes during the cooling process there exist discontinuities in the derivative of the temperature distribution. Thus, the problem is nondifferentiable.Like many real-life problems, the casting model is large and complicated and numerically demanding. NIMBUS provides an efficient way of handling the difficulties and, at the same time, aids the user in finding a satisficing solution. In the end, some numerical experiments are reported and compared with earlier results.  相似文献
9.
Global Interval Methods for Local Nonsmooth Optimization   总被引:4,自引:0,他引:4  
An interval method for determining local solutions of nonsmooth unconstrained optimization problems is discussed. The objective function is assumed to be locally Lipschitz and to have appropriate interval inclusions. The method consists of two parts, a local search and a global continuation and termination. The local search consists of a globally convergent descent algorithm showing similarities to -bundle methods. While -bundle methods use polytopes as inner approximations of the -subdifferentials, which are the main tools of almost all bundle concepts, our method uses axes parallel boxes as outer approximations of the -subdifferentials. The boxes are determined almost automatically with inclusion techniques of interval arithmetic. The dimension of the boxes is equal to the dimension of the problem and remains constant during the whole computation. The application of boxes does not suffer from the necessity to invest methodical and computational efforts to adapt the polytopes to the latest state of the computation as well as to simplify them when the number of vertices becomes too large, as is the case with the polytopes. The second part of the method applies interval techniques of global optimization to the approximative local solution obtained from the search of the first part in order to determine guaranteed error bounds or to improve the solution if necessary. We present prototype algorithms for both parts of the method as well as a complete convergence theory for them and demonstrate how outer approximations can be obtained.  相似文献
10.
A new version of an interactive NIMBUS method for nondifferentiable multiobjective optimization is described. It is based on the reference point idea and the classification of the objective functions. The original problem is transformed into a single objective form according to the classification information. NIMBUS has been designed especially to be able to handle complicated real-life problems in a user-friendly way.The NIMBUS method is used for solving an optimal control problem related to the continuous casting of steel. The main goal is to minimize the defects in the final product. Conflicting objective functions are constructed according to certain metallurgical criteria and some technological constraints. Due to the phase changes during the cooling process there exist discontinuities in the derivative of the temperature distribution. Thus, the problem is nondifferentiable.Like many real-life problems, the casting model is large and complicated and numerically demanding. NIMBUS provides an efficient way of handling the difficulties and, at the same time, aids the user in finding a satisficing solution. In the end, some numerical experiments are reported and compared with earlier results.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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