scientific article; zbMATH DE number 3867074

From MaRDI portal
Publication:3335538





The method of least squares is applied to the following system of linear equalities and inequalities \(A_ 1x=b_ 1\), \(A_ 2x\leq b_ 2\). An algorithm for the obtained quadratic programming problem \[ \|\begin{pmatrix} A_ 1 \\ A_ 2 \end{pmatrix} x- \begin{pmatrix} b_ 1\\ b_ 2 \end{pmatrix} + \begin{pmatrix} O \\ u \end{pmatrix} \| \to \min,\quad u\geq 0 \] is proposed which is based on recurrent computations of some pseudoinverse matrices and gives the solution after a finite number of steps. The numerical realization of the algorithm is discussed in detail.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335538)