An equivalence between two algorithms for a class of Quadratic Programming problems with M-matrices

An equivalence between two algorithms for a class of Quadratic Programming problems with M-matrices

0.00 Avg rating—0 Votes
Article ID: iaor19911377
Country: Germany
Volume: 21
Start Page Number: 189
End Page Number: 195
Publication Date: May 1990
Journal: Optimization
Authors:
Abstract:

In this paper the behaviour of the gradient projection method for the Quadratic Programming problems with M-Matrices and lower bounds on variables is analysed. It is shown that the Chandrasekaran method for solving such problems is simply a realization of the Newton projection method if for the latter one the starting point has components equal to lower bounds on variables.

Reviews

Required fields are marked *. Your email address will not be published.