期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
交叉口有延误的交通网络最短路径算法研究 被引量:14
1
作者 李引珍 《兰州交通大学学报》 CAS 2004年第3期1-3,共3页
在交通规划和VRP研究中,考虑道路网交叉口的延误将更加切合实际,对于节点分方向有延误的最短路问题,传统的Dijkstra不再适用.考虑交叉口分方向的延误情况,给出了一个求此类问题最小时长路径的标号算法,其时间复杂性为O(n2).
关键词 道路网络 交叉口延误 最短路径 算法
下载PDF
Broyden非凸族的全局收敛性 被引量:1
2
作者 郭鹏江 徐大川 《纯粹数学与应用数学》 CSCD 1998年第1期57-60,共4页
利用Byrd等人给出的Ψ函数,采用一种比Wolfe搜索更广泛的搜索技术,对凸函数证明了Broyden非凸族的全局收敛性.
关键词 Broyden非凸族 全局收敛性 Ψ函数 无约束优化
下载PDF
INTERIOR POINT PROJECTED REDUCED HESSIAN METHOD WITH TRUST REGION STRATEGY FOR NONLINEAR CONSTRAINED OPTIMIZATION
3
作者 朱德通 《Applied Mathematics(A Journal of Chinese Universities)》 SCIE CSCD 2004年第3期311-326,共16页
A interior point scaling projected reduced Hessian method with combination of nonmonotonic backtracking technique and trust region strategy for nonlinear equality constrained optimization with nonegative constraint on... A interior point scaling projected reduced Hessian method with combination of nonmonotonic backtracking technique and trust region strategy for nonlinear equality constrained optimization with nonegative constraint on variables is proposed. In order to deal with large problems, a pair of trust region subproblems in horizontal and vertical subspaces is used to replace the general full trust region subproblem. The horizontal trust region subproblem in the algorithm is only a general trust region subproblem while the vertical trust region subproblem is defined by a parameter size of the vertical direction subject only to an ellipsoidal constraint. Both trust region strategy and line search technique at each iteration switch to obtaining a backtracking step generated by the two trust region subproblems. By adopting the l 1 penalty function as the merit function, the global convergence and fast local convergence rate of the proposed algorithm are established under some reasonable conditions. A nonmonotonic criterion and the second order correction step are used to overcome Maratos effect and speed up the convergence progress in some ill-conditioned cases. MR Subject Classification 90C30 - 65K05 - 49M40 Keywords trust region method - backtracking step - reduced Hessian - nonmonotonic technique - interior point Supported partially by the National Natural Science Foundation of China (10071050), Science Foundation (02ZA14070) of Shanghai Technical Sciences Committee and Science Foundation (02DK06) of Shanghai Education Committee. 展开更多
关键词 MR Subject Classification 90C30 65k05 49M40
下载PDF
On filter-successive linearization methods for nonlinear semidefinite programming 被引量:18
4
作者 LI ChengJin SUN WenYu 《Science China Mathematics》 SCIE 2009年第11期2341-2361,共21页
In this paper we present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introd... In this paper we present a filter-successive linearization method with trust region for solutions of nonlinear semidefinite programming. Such a method is based on the concept of filter for nonlinear programming introduced by Fletcher and Leyffer in 2002. We describe the new algorithm and prove its global convergence under weaker assumptions. Some numerical results are reported and show that the new method is potentially effcient. 展开更多
关键词 SEMIDEFINITE PROGRAMMING nonlinear optimization successive LINEARIZATION METHOD FILTER METHOD global CONVERGENCE
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部