Indefinite Quadratic Programming

Simple item page
dc.contributor.authorHager Elhadi Gibrcel
dc.date.accessioned2018-10-10T08:14:23Z
dc.date.available2018-10-10T08:14:23Z
dc.date.issued2008
dc.descriptionStudy research for master in Mathematicsen_US
dc.description.abstractABSTRACT - By ageneral quadratic programming QP problem we mean aQP problem with ageneral indefinite Hessian matrix . In this research an algorithm to 'solve general QP problems is designed .It is based on the extended Dantzig-Wolfe method. The main idea of the method is to use stable factorizations of the Lagrangian matrix ,where QR-factorization of the active set matrix is used. The algorithm is tested using different problems.en_US
dc.description.sponsorshipMohsin H.A.Hashimen_US
dc.identifier.urihttp://hdl.handle.net/123456789/13152
dc.language.isoenen_US
dc.publisherNeelain Universityen_US
dc.subjectIndefinite Quadraticen_US
dc.titleIndefinite Quadratic Programmingen_US
dc.typeThesisen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
هاجر.pdf
Size:
952.58 KB
Format:
Adobe Portable Document Format
Description:
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Masters theses : Statistics