Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
An Algorithm for Solving Quadratic Programming Problems
Authors: V. Moraru
Keywords: Quadratic programming, optimization, active constraints.
– 0.13 Mb
Keywords: Quadratic programming, optimization, active constraints.
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.V.Moraru,
Department of Computing Mathematics
and Programming,
Technical University of Moldova,
168, Bd. Stefan cel Mare,
2012 Kishinev, Moldova
Department of Computing Mathematics
and Programming,
Technical University of Moldova,
168, Bd. Stefan cel Mare,
2012 Kishinev, Moldova
Fulltext
– 0.13 Mb
Contents
- Information model of decision making process for image recognition
- Macroeconomic model of national economy development (extended)
- Models Nonlinear by Parameters
- Construction of complicated multifactor models of optimal form on the basis of statistical data, when the physical essence of phenomenon is known
- Provably indeterminate 128-bit cipher
- The approximate solution of singular integro-differential equations systems on smooth contours in spaces Lp
- The investigation of the algorithms of calculation of optical correlation functions
- An Algorithm for Solving Quadratic Programming Problems
- Algorithms for finding optimal paths in network games with p players
