Primal-Dual Method of Solving Convex Quadratic Programming Problems
This paper presents a primal-dual method for solving quadratic programming problems. The method is based on finding an exact solution of a finite sequence of unconstrained quadratic prigraamming problems and on finding an aproximative solution of constrained minimization problem with simple constrai...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2000-10-01
|
| Series: | Computer Science Journal of Moldova |
| Subjects: | |
| Online Access: | http://www.math.md/nrofdownloads.php?file=/files/csjm/v8-n2/v8-n2-(pp209-220).pdf |