@Article{JCM-27-6,
author = {},
title = {Solving a Class of Inverse QP Problems by a Smoothing Newton Method},
journal = {Journal of Computational Mathematics},
year = {2009},
volume = {27},
number = {6},
pages = {787--801},
abstract = {<p style="text-align: justify;">We consider an inverse quadratic programming (IQP) problem in which the parameters in the objective function of a given quadratic programming (QP) problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. This problem can be formulated as a minimization problem with a positive semidefinite cone constraint and its dual (denoted IQD($A; b$)) is a semismoothly differentiable (SC$^1$) convex programming problem with fewer variables than the original one. In this paper a smoothing Newton method is used for getting a Karush-Kuhn-Tucker point of IQD($A; b$). The proposed method needs to solve only one linear system per iteration and achieves quadratic convergence. Numerical experiments are reported to show that the smoothing Newton method is effective for solving this class of inverse quadratic programming problems. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.2009.09-m2674},
url = {https://global-sci.com/article/84898/solving-a-class-of-inverse-qp-problems-by-a-smoothing-newton-method}
}