A smoothing Newton method for a type of inverse semi-definite quadratic programming problem

✍ Scribed by Xiantao Xiao; Liwei Zhang; Jianzhong Zhang

• Publisher: Elsevier Science
• Year: 2009
• Tongue: English
• Weight: 629 KB
• Volume: 223
• Category: Article
• ISSN: 0377-0427
• DOI: 10.1016/j.cam.2008.01.028

✦ Synopsis

We consider an inverse problem arising from the semi-definite quadratic programming (SDQP) problem. We represent this problem as a cone-constrained minimization problem and its dual (denoted ISDQD) is a semismoothly differentiable (SC 1 ) convex programming problem with fewer variables than the original one. The Karush-Kuhn-Tucker conditions of the dual problem (ISDQD) can be formulated as a system of semismooth equations which involves the projection onto the cone of positive semidefinite matrices. A smoothing Newton method is given for getting a Karush-Kuhn-Tucker point of ISDQD. The proposed method needs to compute the directional derivative of the smoothing projector at the corresponding point and to solve one linear system per iteration. The quadratic convergence of the smoothing Newton method is proved under a suitable condition. Numerical experiments are reported to show that the smoothing Newton method is very effective for solving this type of inverse quadratic programming problems.