排序方式： 共有3条查询结果，搜索用时 5 毫秒
1
1.
用于线性优化的基于核函数的动态步长原-对偶内点算法 总被引：1，自引：2，他引：1
In this paper, primal-dual interior-point algorithm with dynamic step size is implemented for linear programming （LP） problems. The algorithms are based on a few kernel functions, including both serf-regular functions and non-serf-regular ones. The dynamic step size is compared with fixed step size for the algorithms in inner iteration of Newton step. Numerical tests show that the algorithms with dynaraic step size are more efficient than those with fixed step size. 相似文献
2.
Interior-point methods （IPMs） for linear optimization （LO） and semidefinite optimization （SDO） have become a hot area in mathematical programming in the last decades. In this paper, a new kernel function with simple algebraic expression is proposed. Based on this kernel function, a primal-dual interior-point methods （IPMs） for semidefinite optimization （SDO） is designed. And the iteration complexity of the algorithm as O（n^3/4 log n/ε） with large-updates is established. The resulting bound is better than the classical kernel function, with its iteration complexity O（n log n/ε） in large-updates case. 相似文献
3.
本文介绍了Jordan代数及二阶锥的基本知识,在此基础上得到了二阶锥的一些关系式.这些关系式能够在二阶锥优化的复杂性分析中得到应用. 相似文献
1