%0 Journal Article
%T A Modified Lagrange Method for Solving Convex Quadratic Optimization Problems
%A Twum B. Stephen
%A Avoka John
%A Christian J. Etwire
%J Open Journal of Optimization
%P 1-20
%@ 2325-7091
%D 2024
%I Scientific Research Publishing
%R 10.4236/ojop.2024.131001
%X In this paper, a modified version of the Classical
Lagrange Multiplier method is developed for convex quadratic optimization
problems. The method, which is evolved from the first order derivative test for
optimality of the Lagrangian function with respect to the primary variables of
the problem, decomposes the solution process into two independent ones, in
which the primary variables are solved for independently, and then the
secondary variables, which are the Lagrange multipliers, are solved for,
afterward. This is an innovation that leads to solving independently two
simpler systems of equations involving the primary variables only, on one hand,
and the secondary ones on the other. Solutions obtained for small sized
problems (as preliminary test of the method) demonstrate that the new method is
generally effective in producing the required solutions.
%K Quadratic Programming
%K Lagrangian Function
%K Lagrange Multipliers
%K Optimality Conditions
%K Subsidiary Equations
%K Modified Lagrange Method
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=131813