Abstract
We make use of the properties of the class of extended ABS (EABS) algorithms to present an efficient class of algorithms for computing the search directions of the primal{dual infeasible interior point methods (IIPMs) for solving convex quadratic programming problems (CQPs), when when the number of variables and constraints are equal. We show that, in this case, the parameters of the EABS algorithms for computing a search direction can always be chosen so that a part of the search vectors of the corresponding member of the class of EABS algorithms does not change in various iterations of the IIPMs. Keywords: Quadratic programming, Infeasible interior point methods, Primal-dual algorithms, ABS algorithms, Search direction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Applied Mathematical Research
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.