Results and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems

α
Awatif Mohammed Ali Elsiddieg
Awatif Mohammed Ali Elsiddieg

Send Message

To: Author

Results and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems

Article Fingerprint

ReserarchID

G0L06

Results and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems Banner

AI TAKEAWAY

Connecting with the Eternal Ground
  • English
  • Afrikaans
  • Albanian
  • Amharic
  • Arabic
  • Armenian
  • Azerbaijani
  • Basque
  • Belarusian
  • Bengali
  • Bosnian
  • Bulgarian
  • Catalan
  • Cebuano
  • Chichewa
  • Chinese (Simplified)
  • Chinese (Traditional)
  • Corsican
  • Croatian
  • Czech
  • Danish
  • Dutch
  • Esperanto
  • Estonian
  • Filipino
  • Finnish
  • French
  • Frisian
  • Galician
  • Georgian
  • German
  • Greek
  • Gujarati
  • Haitian Creole
  • Hausa
  • Hawaiian
  • Hebrew
  • Hindi
  • Hmong
  • Hungarian
  • Icelandic
  • Igbo
  • Indonesian
  • Irish
  • Italian
  • Japanese
  • Javanese
  • Kannada
  • Kazakh
  • Khmer
  • Korean
  • Kurdish (Kurmanji)
  • Kyrgyz
  • Lao
  • Latin
  • Latvian
  • Lithuanian
  • Luxembourgish
  • Macedonian
  • Malagasy
  • Malay
  • Malayalam
  • Maltese
  • Maori
  • Marathi
  • Mongolian
  • Myanmar (Burmese)
  • Nepali
  • Norwegian
  • Pashto
  • Persian
  • Polish
  • Portuguese
  • Punjabi
  • Romanian
  • Russian
  • Samoan
  • Scots Gaelic
  • Serbian
  • Sesotho
  • Shona
  • Sindhi
  • Sinhala
  • Slovak
  • Slovenian
  • Somali
  • Spanish
  • Sundanese
  • Swahili
  • Swedish
  • Tajik
  • Tamil
  • Telugu
  • Thai
  • Turkish
  • Ukrainian
  • Urdu
  • Uzbek
  • Vietnamese
  • Welsh
  • Xhosa
  • Yiddish
  • Yoruba
  • Zulu

References

19 Cites in Article
  1. Amo (2015). Advanced Modeling and Optimization.
  2. Mihai Anitescu (2005). On Using the Elastic Mode in Nonlinear Programming Approaches to Mathematical Programs with Complementarity Constraints.
  3. D Bertsekas (1991). Linear Network Optimization: Algorithms and codes.
  4. G David,Luenberger (2003). Linear and nonlinear programming 2 nd Edition.
  5. J Dennis,Robert Schnabel (1996). Numerical Methods for Unconstrained Optimization and Nonlinear Equations.
  6. R Fletcher (1987). Praclical methods of optimization, 2nd ed, R. Fletcher. John Wiley & ISBN 0‐471‐86187, £24.50. pp. xii + 436. Sons, Chichester, 1987.
  7. Roger Fletcher,Sven Leyffer (2002). Nonlinear programming without a penalty function.
  8. Nicholas Gould,Philippe Toint (2002). An iterative working-set method for large-scale nonconvex quadratic programming.
  9. Pardalos Horst,Thoai (1995). Introduction to global optimization.
  10. Kocava,M Stingl,Pennon (2003). A code for non-covex non-linear and semi definite programming optimization methods nonlinear and semi-definite programming optimization methods and software.
  11. P Lasunon,T Remsungnen (2011). A new method for solving Tri-level Linear Programming Problems.
  12. Baoding Liu,Kai Yao (2014). Uncertain multilevel programming: Algorithm and Applications.
  13. J Michael,Best (2017). Quadratic programming with computer programs.
  14. Hans Ferreau,Christian Kirches,Andreas Potschka,Hans Bock,Moritz Diehl (2014). qpOASES: a parametric active-set algorithm for quadratic programming.
  15. Qpschur (2005). A dual, active -set, Schur-complement method for large -scale and structured convex quadratic programming.
  16. Reha Tutuncu (2006). Optimization Methods in Finance.
  17. Stephen Nash,Ariela Sofer (1996). Linear and non -liner programming.
  18. Adam Silber,Petr Kovář,Pavla Kabelíková–hrušková,Michal Kravčenko (2009). On Regular Distance Magic Graphs of Odd Order.
  19. Wayne Otes (1961). Wayne E. Otes.

Funding

No external funding was declared for this work.

Conflict of Interest

The authors declare no conflict of interest.

Ethical Approval

No ethics committee approval was required for this article type.

Data Availability

Not applicable for this article.

How to Cite This Article

Awatif Mohammed Ali Elsiddieg. 2018. \u201cResults and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems\u201d. Global Journal of Science Frontier Research - F: Mathematics & Decision GJSFR-F Volume 18 (GJSFR Volume 18 Issue F7): .

Download Citation

Issue Cover
GJSFR Volume 18 Issue F7
Pg. 13- 20
Journal Specifications

Crossref Journal DOI 10.17406/GJSFR

Print ISSN 0975-5896

e-ISSN 2249-4626

Keywords
Classification
GJSFR-F Classification: FOR Code: MSC 2010: 00A69
Version of record

v1.2

Issue date

October 15, 2018

Language
en
Experiance in AR

Explore published articles in an immersive Augmented Reality environment. Our platform converts research papers into interactive 3D books, allowing readers to view and interact with content using AR and VR compatible devices.

Read in 3D

Your published article is automatically converted into a realistic 3D book. Flip through pages and read research papers in a more engaging and interactive format.

Article Matrices
Total Views: 3086
Total Downloads: 1361
2026 Trends
Related Research

Published Article

Abstract not found

Our website is actively being updated, and changes may occur frequently. Please clear your browser cache if needed. For feedback or error reporting, please email [email protected]

Request Access

Please fill out the form below to request access to this research paper. Your request will be reviewed by the editorial or author team.
X

Quote and Order Details

Contact Person

Invoice Address

Notes or Comments

This is the heading

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Ut elit tellus, luctus nec ullamcorper mattis, pulvinar dapibus leo.

High-quality academic research articles on global topics and journals.

Results and Conclusion of An Algorithm For Solving Indefinite QR-Programming Problems

Awatif Mohammed Ali Elsiddieg
Awatif Mohammed Ali Elsiddieg

Research Journals