An Algorithm for Solving Quadratic Programming Problems
Year: 1997
Type: article
Abstract: 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 convenient organization of the Calculus. Optimal solution is determined in a finite number of iterations. It is discussed the extension of the algorithm over solving quadratic non-convex programming problems.
Author: V. Moraru
Institution: Technical University of Moldova
Language: English
Subfield: Numerical Analysis
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W122301491