The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

Colin W. Cryer · SIAM Journal on Control · 1971

Let ${\bf A}$ be a real symmetric positive definite $n \times n$ matrix and ${\bf b}$ a real column n-vector. We consider the following problem: Find real column n-vectors ${\bf x}$ and ${\bf y}$ such that \[{\bf A}{\bf x} = {\bf b} + {\bf y},\]\[{\bf x}^T {\bf y} = 0,\quad {\bf x} \geqq 0,\quad {\bf y} \geqq 0.\] Problems of this type occur when the method of Christopherson is used to solve free boundary problems for journal bearings. In such cases, ${\bf A}$ is a “finite difference" matrix. We present a method for solving the above problem which is a modification of systematic over-relaxation. This method is particularly suitable when ${\bf A}$ is a finite difference matrix.

Cited by 437 works. doi:10.1137/0309028

Authors

References