Abstract
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.
Highlights
Practical Application of the Algorithm we give the detailed outlines of the algorithm ofThe algorithm presented above represents a general outline of a indefinite quadratic programming problems
It references to the method for solving indefinite quadratic programming problems rather numbers of some equations and conditions appeared in the following than an exact definition of a computer implementation
Equations [1-8]: we discuss the computational work performed by the algorithm, and min λ(K) i i∈η
Summary
The algorithm presented above represents a general outline of a indefinite quadratic programming problems. It references to the method for solving indefinite quadratic programming problems rather numbers of some equations and conditions appeared in the following than an exact definition of a computer implementation. Equations [1-8]: we discuss the computational work performed by the algorithm, and min λ(K) i i∈η (1) twrye ftoollaocwh,iewviethefsfliicgihent cmyoadnidficsattaiboinlist,ythase pwoosrskibolfeGasillwaencdaMn.uIrnradyowinhgicsho and has been applied to active set methods since mid-seventies until now. In the case when (2) G is positive (semi definite) the active set methods are considered to be equivalent, [20], pointed out. There he gave a detailed description of that equivalence.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: Journal of Applied & Computational Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
