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 functio...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.展开更多
提出用非线性序列二次规划(SQP,Sequen tial Q uadratic P rogramm ing)算法解决发动机性能寻优控制问题。分析了线性规划(LP,L inear P rogramm ing)算法用于发动机性能寻优的固有缺陷以及SQP算法的优点。给出了SQP算法与LP算法用于最...提出用非线性序列二次规划(SQP,Sequen tial Q uadratic P rogramm ing)算法解决发动机性能寻优控制问题。分析了线性规划(LP,L inear P rogramm ing)算法用于发动机性能寻优的固有缺陷以及SQP算法的优点。给出了SQP算法与LP算法用于最大推力模式和最小油耗模式仿真结果对比曲线。数字仿真实验的结果表明,SQP算法具有比LP算法更好的优化效果,在工程实际中有很大的应用潜力。展开更多
基金Project supported by Dutch Organization for Scientific Research(Grant No .613 .000 .010)
文摘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.
文摘提出用非线性序列二次规划(SQP,Sequen tial Q uadratic P rogramm ing)算法解决发动机性能寻优控制问题。分析了线性规划(LP,L inear P rogramm ing)算法用于发动机性能寻优的固有缺陷以及SQP算法的优点。给出了SQP算法与LP算法用于最大推力模式和最小油耗模式仿真结果对比曲线。数字仿真实验的结果表明,SQP算法具有比LP算法更好的优化效果,在工程实际中有很大的应用潜力。