Katalog GES



SOLVING A CLASS OF INVERSE QP PROBLEMS BY A SMOOTHING NEWTON METHOD

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... Full description

1st Person: Xiao, Xiantao
Additional Persons: Zhang, Liwei verfasserin
Source: in Journal of computational mathematics : a publication of Institute of Computational Mathematics, Chinese Academy of Sciences Vol. 27, No. 6 (2009), p. 787-801
More Articles
Type of Publication: Article
Language: English
Published: 2009
Keywords: research-article
Online: Volltext
  Search for full text

Online

Volltext

Similar Items

Cannot find similar records

Library Services

Search Options

Quick links

Orientation