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: |
Institute of Mathematics and Computer Science of the Academy of Sciences of Moldova
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) -
Hybrid Algorithm for Solving the Quadratic Assignment Problem
by: Mohammed Essaid Riffi, et al.
Published: (2019-03-01) -
The PPADMM Method for Solving Quadratic Programming Problems
by: Hai-Long Shen, et al.
Published: (2021-04-01) -
Solving Interval Quadratic Programming Problems by Using the Numerical Method and Swarm Algorithms
by: M. A. Elsisy, et al.
Published: (2020-01-01) -
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
by: Hou Zhisong, et al.
Published: (2017-10-01)