An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems
We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP 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 semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) 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 primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semidefinite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetricmatrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, whichmore »
 Authors:

^{[1]};
^{[2]}
 Beijing Normal UniversityHong Kong Baptist University, United International College (China)
 Dalian University of Technology, School of Mathematical Sciences (China)
 Publication Date:
 OSTI Identifier:
 21480277
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Applied Mathematics and Optimization; Journal Volume: 61; Journal Issue: 1; Other Information: DOI: 10.1007/s002450099075z; Copyright (c) 2010 Springer Science+Business Media, LLC
 Country of Publication:
 United States
 Language:
 English
 Subject:
 97 MATHEMATICAL METHODS AND COMPUTING; CONVERGENCE; LAGRANGIAN FUNCTION; MATHEMATICAL SOLUTIONS; MATHEMATICAL SPACE; MATRICES; MINIMIZATION; NEWTON METHOD; PROGRAMMING; PROJECTION OPERATORS; SYMMETRY CALCULATION METHODS; FUNCTIONS; ITERATIVE METHODS; MATHEMATICAL OPERATORS; OPTIMIZATION; SPACE