期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
集值B-H-S变分不等式及其应用 被引量:2
1
作者 张从军 《大学数学》 1995年第4期35-41,共7页
本文在Danach空间中,研究了集值B-H-S变分不等式问题和相补问题.将有限维空间、单值映象的若干结果改进并推广到无穷维空间.利用本文获得的结果.我们解决了无穷维空间中的鞍点问题和两类规划问题.
关键词 VARIATIONAL INEQUALITY complementarity PROBLEM SADDLE point.programming problem.
在线阅读 下载PDF
Kinematic Geometry for the Saddle Line Fitting of Planar Discrete Positions 被引量:1
2
作者 WU Yu WANG Delun +2 位作者 WANG Wei YU Shudong XU Wenji 《Chinese Journal of Mechanical Engineering》 SCIE EI CAS CSCD 2015年第4期763-768,共6页
The position synthesis of planar linkages is to locate the center point of the moving joint on a rigid link, whose trajectory is a circle or a straight line. Utilizing the min-max optimization scheme, the fitting curv... The position synthesis of planar linkages is to locate the center point of the moving joint on a rigid link, whose trajectory is a circle or a straight line. Utilizing the min-max optimization scheme, the fitting curve needs to minimize the maximum fitting error to acquire the dimension of a planar binary P-R link. Based on the saddle point programming, the fitting straight line is determined to the planar discrete point-path traced by the point of the rigid body in planar motion. The property and evolution of the defined saddle line error can be revealed from three given separate points. A quartic algebraic equation relating the fitting error and the coordinates is derived, which agrees with the classical theory. The effect of the fourth point is discussed in three cases through the constraint equations. The multi-position saddle line error is obtained by combination and comparison from the saddle point programming. Several examples are presented to illustrate the solution process for the saddle line error of the moving plane. The saddle line error surface and the contour map presented to show the variations of the fitting error in the fixed frame. The discrete kinematic geometry is then set up to disclose the relations of the separate positions of the rigid body, the location of the tracing point on the moving body, and the position and orientation of the saddle line to the point-path. This paper presents a new analytic geometry method for saddle line fitting and provides a theoretical foundation for position synthesis. 展开更多
关键词 saddle point programming kinematic geometry saddle line error position synthesis
在线阅读 下载PDF
Primal dual interior point dynamic programming for coordinated charging of electric vehicles 被引量:1
3
作者 Jian ZHANG Yigang HE +1 位作者 Mingjian CUI Yongling LU 《Journal of Modern Power Systems and Clean Energy》 SCIE EI 2017年第6期1004-1015,共12页
Coordinated charging of electric vehicles(EVs)is critical to provide safe and cost effective operation of distribution systems where household single phase charging of EV could contribute to imbalance of the distribut... Coordinated charging of electric vehicles(EVs)is critical to provide safe and cost effective operation of distribution systems where household single phase charging of EV could contribute to imbalance of the distribution system.To date,reported researches on optimization methods for coordinated charging aiming at minimizing power losses have the disadvantages of low calculation efficiency when applied to large systems or have not taken the voltage constraints into account.The phase component and polar coordinates power flow equations of an unbalanced distribution system are derived.Primal dual interior point dynamic programming is introduced for coordinated charging of EVs to minimize distribution system losses where charging demand,voltage and current constraints have been taken into account.The proposed optimization is evaluated using an actual 423-bus case as the test system.Results are promisingwith the proposed method having good convergence under time-efficient calculations while providing optimization of power losses,lower load variance,and improvement of voltage profile versus uncoordinated scenarios. 展开更多
关键词 Electric vehicles(EVs) Coordinated charging Primal dual interior point programming Distribution system Power losses
原文传递
A BRANCH BOUND METHOD FOR SUBSET SUM PROBLEM 被引量:1
4
作者 吴士泉 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 1994年第3期302-314,共13页
This paper indicates the possible difficulties for applying the interior point method to NPcomplete problems,transforms an NP-complete problem into a nonconvex quadratic program and then develops some convexity theori... This paper indicates the possible difficulties for applying the interior point method to NPcomplete problems,transforms an NP-complete problem into a nonconvex quadratic program and then develops some convexity theories for it. Lastly it proposes an algorithm which uses Karmarkar's algorithm as a subroutine. The finite convergence of this algorithm is also proved. 展开更多
关键词 Subset sum problem nonconvex quadratic program convex envelope interior point method
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部