Scholars Central

Research articlePublished 2018

An Algorithm for Solving Indefinite Quadratic Programming Problems

Authors: Siddieg AMAEl

Journal of Applied & Computational Mathematics

Volume 7 · Issue 1 · Pages 1–4

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

In this paper, we give in section (1) compact description of the algorithm for solving general quadratic programming problems (that is, obtaining a local minimum of a quadratic function subject to inequality constraints) is presented. In section (2), we give practical application of the algorithm, we also discuss the computation work and performing by the algorithm and try to achieve efficiency and stability as possible as we can. In section (3), we show how to update the QR-factors of , when the tableau is complementary ,we give updating to the LDLT-Factors of . In section (4) we are not going to describe a fully detailed method of obtaining an initial feasible point, since linear programming literature is full of such techniques.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Applied & Computational Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Applied & Computational Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Siddieg AMAEl”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels