共查询到10条相似文献,搜索用时 62 毫秒
1.
主要研究对称正定矩阵群上的内蕴最速下降算法的收敛性问题.首先针对一个可转化为对称正定矩阵群上无约束优化问题的半监督度量学习模型,提出对称正定矩阵群上一种自适应变步长的内蕴最速下降算法.然后利用李群上的光滑函数在任意一点处带积分余项的泰勒展开式,证明所提算法在对称正定矩阵群上是线性收敛的.最后通过在分类问题中的数值实验说明算法的有效性. 相似文献
2.
研究机器带学习效应, 目标函数为时间表长的两台平行机排序问题, 问题是NP-难的. 首先建立了求解该问题最优解的整数规划模型. 其次, 基于模拟退火算法给出了该问题的近似算法SA, 并证明了该算法依概率1 全局收敛到最优解. 最后, 通过数值模拟对所提出的算法进行了性能分析. 数值模拟结果表明, 近似算法SA可以达到最优值的99%, 准确度高, 算法较有效. 相似文献
3.
Nezam Mahdavi-Amiri Rohollah Yousefpour 《Journal of Optimization Theory and Applications》2012,155(1):180-195
To construct an effective minimization algorithm for locally Lipschitz functions, we show how to compute a descent direction satisfying Armijo’s condition. We present a finitely terminating algorithm to construct an approximating set for the Goldstein subdifferential leading to the desired descent direction. Using this direction, we propose a minimization algorithm for locally Lipschitz functions and prove its convergence. Finally, we implement our algorithm with matrix laboratory (MATLAB) codes and report our testing results. The comparative numerical results attest to the efficiency of the proposed algorithm. 相似文献
4.
In this paper we consider a class of semi-infinite transportation problems. We develop an algorithm for this class of semi-infinite transportation problems. The algorithm is a primal dual method which is a generalization of the classical algorithm for finite transportation problems. The most important aspect of our paper is that we can prove the convergence result for the algorithm. Finally, we implement some examples to illustrate our algorithm. 相似文献
5.
王新赠 《数学建模及其应用》2015,4(3):49-60
首先讨论了ICM公司职位分配到职员办公室的原则,并讨论了在这些原则下一个合理分配方案的合作网络和监管网络构成的混合网络模型;然后,利用该模型的节点属性、公司职员属性及两者之间的关系建立了后档案矩阵,讨论了公司职员属性函数,在此基础上研究了包含职员离职算法、内部升迁算法和外部招聘算法的动力学分析;最后,在混合网络模型中利用算法进行了动力学仿真。 相似文献
6.
几何定理机器证明的WE完全方法 总被引:6,自引:0,他引:6
在几何定理机器证明的各种方法中,吴氏方法获得了显著的成功.如预先把有关代数簇分解为不可约簇,则吴氏方法可成为完全方法.本文在吴法的基础上,以辗转伪除法为辅助工具,发展出一种不必预先分解代数簇的完全方法,并给出一些手算实例. 相似文献
7.
In this paper, we propose a fast algorithm for computing the spectral radii of symmetric nonnegative tensors. In particular, by this proposed algorithm, we are able to obtain the spectral radii of weakly reducible symmetric nonnegative tensors without requiring the partition of the tensors. As we know, it is very costly to determine the partition for large‐sized weakly reducible tensors. Numerical results are reported to show that the proposed algorithm is efficient and also able to compute the spectral radii of large‐sized tensors. As an application, we present an algorithm for testing the positive definiteness of Z‐tensors. By this algorithm, it is guaranteed to determine the positive definiteness for any Z‐tensor. 相似文献
8.
9.
On the computation of an element of Clarke generalized Jacobian for a vector-valued max function 总被引:1,自引:0,他引:1
In this paper, we present an algorithm for calculating an element of Clarke generalized Jacobian for a vector-valued max-type function. The algorithm reduces the computational cost of an existing algorithm. 相似文献
10.
Hong Zheng Yi-Chang Chiu Pitu B. Mirchandani 《Journal of Mathematical Modelling and Algorithms》2014,13(2):169-189
This paper presents a heuristic algorithm for the earliest arrival flow problem. Existing exact algorithms, even polynomial in the output size, contain submodular function optimization as a frequently called subroutine, and thus are not practical in real-life applications. In this paper we propose an algorithm that does not involve the submodular function optimization. Although solving an EAF near-optimal, the algorithm is remarkably simple and efficient as it only involves shortest path computations on a static network. A numerical example illustrates how the algorithm works. As an application, we demonstrate the algorithm’s solution quality and computational performance by solving a real-size network. 相似文献