A Method for Solving the Indefinite Quadratic Programming Problem
Raymond K. Mueller
Abstract
Raymond K. Mueller
Abstract
A method is developed for obtaining a solution to the quadratic programming problem with an indefinite quadratic objective function. A search procedure using gradient projection is the core of the method. However at each step an alternate direction to gradient projection is proposed and two methods are given to continue after the revised gradient projection procedure terminates. Although convergence to the solution is not guaranteed, good results were obtained for fifty-seven problems used to test the method.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A method is developed for obtaining a solution to the quadratic programming problem with an indefinite quadratic objective function. A search procedure using gradient projection is the core of the method. However at each step an alternate direction to gradient projection is proposed and two methods are given to continue after the revised gradient projection procedure terminates. Although convergence to the solution is not guaranteed, good results were obtained for fifty-seven problems used to test the method.
Key concepts: Quadratic programming, Projection (relational algebra), Mathematics, Convergence (economics), Projection method, Mathematical optimization, Gradient method, Sequential quadratic programming