No label defined (Q4517003)

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 1533655
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1533655

      Statements

      0 references
      20 November 2000
      0 references
      mathematical programming
      0 references
      variational method
      0 references
      generalized solution
      0 references
      existence result
      0 references
      The article is devoted to studying the following mathematical programming problem: minimize a function \(f_0(x)\) under the restrictions \(f_1(x)\leq 0\), \(\dots\), \(f_m(x)\leq 0\). Here \(x\in \mathbb R^n\), \(f_0(x)\), \(f_1(x),\dots f_m(x)\) are continuously differentiable convex functions. The problem is rewritten as follows: \(f_0(x) - l_k\leq 0\), \(f_1(x)\leq 0\), \(\dots\), \(f_m(x)\leq 0\), \(\lim_{k\to\infty} l_k =\gamma_0\), where \(l_0 = \Delta\gamma\) and \(\gamma = \min\{f_0(x) \quad f_1(x)\leq 0\), \(\dots\), \(f_m(x)\leq 0\}\). For solving the problem, the author exposes a new algorithm consisting in two steps. First, unsolvability of the problem is verified and, next, in the case of solvability, an optimal solution is found. For the entire collection see [Zbl 0932.00035].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references