A finite algorithm for a particular difference of convex functions quadratic programming problem

A finite algorithm for a particular difference of convex functions quadratic programming problem

0.00 Avg rating0 Votes
Article ID: iaor20032543
Country: Netherlands
Volume: 117
Issue: 1
Start Page Number: 33
End Page Number: 49
Publication Date: Nov 2002
Journal: Annals of Operations Research
Authors: ,
Abstract:

In this paper a particular quadratic minimum program, having a particular d.c. objective function, is studied. Some theoretical properties of the problem are stated and the existence of minimizers is characterized. A solution algorithm, based on the so called ‘optimal level solutions’ approach, is finally proposed.

Reviews

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