An Algorithm for Solving Quadratic Programming Problems
Herein is investigated the method of solution of quadratic programming problems. The algorithm is based on the effective selection of constraints. Quadratic programming with constraints-equalities are solved with the help of an algorithm, so that matrix inversion is avoided, because of the more conv...
Main Author: | V. Moraru |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
1997-08-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v5-n2/v5-n2-(pp223-235).pdf |
Similar Items
-
Primal-Dual Method of Solving Convex Quadratic Programming Problems
by: V. Moraru
Published: (2000-10-01) -
SOLVING THE DAYS-OFF SCHEDULING PROBLEM USING QUADRATIC PROGRAMMING WITH CIRCULANT MATRIX
by: MORARU, Vasile, et al.
Published: (2022-12-01) -
The PPADMM Method for Solving Quadratic Programming Problems
by: Hai-Long Shen, et al.
Published: (2021-04-01) -
New Algorithm to Solve Mixed Integer Quadratically Constrained Quadratic Programming Problems Using Piecewise Linear Approximation
by: Loay Alkhalifa, et al.
Published: (2022-01-01) -
Enhancing convexification techniques for solving nonconvex quadratic programming problems
by: Qi, Xiaofei
Published: (2017)