期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
一种新的求解P*(k)阵原始-对偶路径跟踪算法
1
作者 龚小玉 《广东石油化工学院学报》 2013年第4期79-83,共5页
对P*(k)阵线性互补问题提出了一种新的原始-对偶路径跟踪算法,算法是基于一种新的工具找到搜寻方向和中心路径邻域,并证明了此算法的迭代复杂性为O(2/1nlog[n+4(1+k)δ2]/εμ0),与目前最好的算法迭代复杂性一致。
关键词 内点算法 路径跟踪算法 多项式复杂性 P*(k)阵线性互补问题
在线阅读 下载PDF
A linear complementarity model for multibody systems with frictional unilateral and bilateral constraints 被引量:1
2
作者 Hai-Ping Gao Qi Wang Shi-Min Wang Li Fu 《Acta Mechanica Sinica》 SCIE EI CAS CSCD 2011年第4期587-592,共6页
The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the ... The Lagrange-I equations and measure differential equations for multibody systems with unilateral and bilateral constraints are constructed. For bilateral constraints, frictional forces and their impulses contain the products of the filled-in relay function induced by Coulomb friction and the absolute values of normal constraint reactions. With the time-stepping impulse-velocity scheme, the measure differential equations are discretized. The equations of horizontal linear complementarity problems (HLCPs), which are used to compute the impulses, are constructed by decomposing the absolute function and the filled-in relay function. These HLCP equations degenerate into equations of LCPs for frictional unilateral constraints, or HLCPs for frictional bilateral constraints. Finally, a numerical simulation for multibody systems with both unilateral and bilateral constraints is presented. 展开更多
关键词 Coulomb friction Bilateral constraint Unilat-eral constraint - Horizontal linear complementarity problem(HLCP) Time-stepping impulse-velocity algorithm
在线阅读 下载PDF
Nonconvex Quadratic Programming Method for k-Coloring Problem:Algorithm and Computation
3
作者 Cao Jiaming(Department of Transportation Engineering) ,Southwest Jiaotong University,Chengdu 610031, China 《Journal of Modern Transportation》 1994年第2期138-145,共8页
In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above... In this paper, we consider the socalled k-coloring problem in general case.Firstly, a special quadratic 0-1 programming is constructed to formulate k-coloring problem. Secondly, by use of the equivalence between above quadratic0-1 programming and its relaxed problem, k-coloring problem is converted intoa class of (continuous) nonconvex quadratic programs, and several theoreticresults are also introduced. Thirdly, linear programming approximate algorithmis quoted and verified for this class of nonconvex quadratic programs. Finally,examining problems which are used to test the algorithm are constructed andsufficient computation experiments are reported. 展开更多
关键词 k-coloring problem quadratic 0-1 programming relaxed equivalence nonconvex quadratic programming linear programming approximatealgorithm
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部