点击次数：
论文类型：期刊论文
发表时间：2009-05-01
发表刊物：JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION
收录刊物：SCIE、Scopus
卷号：5
期号：2
页面范围：319-339
ISSN号：1547-5816
关键字：Inverse optimization; quadratic programming; the augmented Lagrangian method; the cone of positive semi-definite matrices; rate of convergence; Newton method
摘要：We consider an inverse problem raised from the semi-definite quadratic programming (SDQP) problem. In the inverse problem, the parameters in the objective function of a given SDQP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semi-definite cone constraint and its dual is a linearly positive semi-definite cone constrained semi smoothly differentiable (SC1) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primaliterates, generated by the augmented Lagrange method, is proportionalto 1/t, and the rate of multiplier iterates is proportional to 1/root t, where t is the penalty parameter in the augmented Lagrangian. The numerical results are reported to show the effectiveness of the augmented Lagrangian method for solving the inverse semi-definite quadratic programming problem.