No label defined (Q4196236)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3635813
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3635813

      Statements

      0 references
      0 references
      1978
      0 references
      linear programming
      0 references
      convergence analysis
      0 references
      Considered is the weak form of \par \centerline{ (1) \(\min\langle c,x\rangle\), subject to \(A_1x=b_1\), \(A_2x\le b_2\),} \par that is \par \centerline{ (2) \(\min\langle c,x\rangle\), subject to \(G(x)\le r\),} \par where \(r >0\), \(G(x)=\Vert A_ix-b_i\Vert^2 + \sum_{i=1}^{m_2} (A_{2i}x - b_{2i})_+^2\), \((\cdot)_+= \max\{0, (\cdot)\}\), \(A_{2i}\) is the \(i\)th row of the \((m_2\times n)\) matrix \(A_2\). Assuming (1) has an unique solution \(x^*\), the solution \(x(r) = x^*\) for \(r=0\). The properties of the solution set of (2) is discussed. After some modifications, the Lagrange function of (2) is constructed such that a penalty coefficient \(K\) occurs. Using the algorithm of \textit{V. T. Polyak} and \textit{N. V. Tret'yakov} [``A certain iteration method of linear programming and its economic interpretation.'' (Russian) Èkonom. Mat. Metody 8, No. 5, 740--751 (1972)], the authors give a scheme for determining the penalty coefficient and prove that the algorithm converges geometrically. A numerical example is attached.
      0 references

      Identifiers