A global error bound via the SQP method for constrained optimization problem

作者：Zhao Wen Ling^*; Song Dao Jin

来源：Journal of Industrial and Management Optimization, 2007, 3(4): 775-781.

• SQP problem
• value function
• global error bound
• convergence

For the constrained optimization problem, under the condition that the objective function is strongly convex, we obtain a global error bound for the distance between any feasible solution and the optimal solution by using the merit function in the sequential quadratic programming (SQP) method.

• 出版日期2007-11
• 单位大连理工大学