Results and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems
Keywords:
Abstract
In this paper we have two sections. In section (1), we write a Matlab program and apply it to solve chosen problems in general QP –problems, we use sub programs[11]. Section (2) conclude our work reported in this paper gave no account to the special structures that the matrix of constraints A might have. The work is ideal when A is dense, that is, full of non-zero elements. [19 ].
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Awatif Mohammed Ali Elsiddieg. (2018). Results and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems. Global Journal of Science Frontier Research, 18(F7), 13–20. Retrieved from https://journalofscience.org/index.php/GJSFR/article/view/2656
Published
2018-05-15
Issue
Section
Articles
License
Copyright (c) 2018 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.