Abstract
Inithis paper, we discuss computational aspeets of an interior point algorithm (1) for indefinite quadratic programming problems with b lems with an ellipsoid constraint. In addition, we present a. sufficient condition' for a local minimizer to be global, and we use this resUlt to generate test problems with a. kno,wn global solution. The proposed algorithm has been implemented on an IBM 3090 computer and tested on a variety of den$e test problems, including problems with a known global optimizer.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
