Abstract
In this paper we present a pivotal-based algorithm for the global minimization of composite concave quadratic functions subject to linear constraints. It is shown that certain subclasses of this family yield easy-to-solve line search subproblems. Since the proposed algorithm is equivalent in efficiency to a standard parametric complementary pivoting procedure, the implication is that conventional parametric quadratic programming algorithms can now be used as tools for the solution of much wider class of complex global optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have