An efficient algorithm for a class of equality-constrained optimization problems (Q3790952)

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 4055385
Language Label Description Also known as
default for all languages
No label defined
    English
    An efficient algorithm for a class of equality-constrained optimization problems
    scientific article; zbMATH DE number 4055385

      Statements

      An efficient algorithm for a class of equality-constrained optimization problems (English)
      0 references
      0 references
      1987
      0 references
      Lagrange multiplier-free method
      0 references
      superlinear convergence
      0 references
      least distance problem
      0 references
      The paper deals with computing a solution x * of the nonlinear programming problem: \(\| x-\bar x\|\) \(2\to \min\); subject to \(H(x)=0\) (the least distance problem), where \(H: R^{n+1}\mapsto R^ n\), \(\bar x\) fixed. An auxiliary system of nonlinear equations \(F(z)=0\), \(F: R^{2n+2}\mapsto R^{2n+2}\) is constructed the solution of which contains x *. The special structure of the auxiliary problem enables to solve the problem by an efficient algorithm. Some convergence properties are shown.
      0 references
      0 references

      Identifiers