基于SQP算法的形状误差统一评定

根据形状误差定义及数学规划理论,建立了形状误差包容评定的统一的非线性规划模型,指出了这模型实质上是多目标优化的问题。再将该优化问题转化成单目标优化问题,并对该问题提出了用逐次二次规划的解法（SQP法）。由于模型是凸的,在求解中SQP法又能保留非线性的信息,因此评定过程对初始参数的要求低,且稳定、可靠、效率高。几个算例的验证结果均符合凸规划全局最优判别准则。

Unified Evaluation Method for Form Errors Based on SQP Algorithm

Based on the definition for form error and theory of mathematics programming, a non-linear programming model was built for form error evaluation. This non-linear model was further proved, in essence, to be a multi-target optimization problem, and could be transformed into a single-target optimization problem. A unified and efficient successive quadratic programming method (SQP algorithm) was proposed to solve these models. As these programming models were convex, and SQP algorithm could retain the non-linear information of the models during the process of calculation. So it has very loose requirement for initial parameters. The method is also stable, reliable and high-efficient. The results of several experiments of form error evaluation showed that the method fitted the requirements for convex programming's global optimization very well which proved the above-mentioned conclusion.