A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (Q949372)

From MaRDI portal





scientific article; zbMATH DE number 5354688
Language Label Description Also known as
default for all languages
No label defined
    English
    A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule
    scientific article; zbMATH DE number 5354688

      Statements

      A modified BFGS method and its superlinear convergence in nonconvex minimization with general line search rule (English)
      0 references
      0 references
      0 references
      0 references
      21 October 2008
      0 references
      The authors make efforts to establish a new algorithm for solving unconstrained optimization problems. It bases on the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method with a suitable line-search. It differs from the standard approach by making use of an auxiliary function which has the same global minimum as the objective function -- more precisely it depends on the minimizer. A global convergence analysis is carried out and shows a super-linear convergence. However, it remains obscure how an implementation could look like and the English is dissatisfying.
      0 references
      unconstrained optimization
      0 references
      modified BFGS
      0 references
      line search
      0 references
      global convergence
      0 references
      Broyden-Fletcher-Goldfarb-Shanno (BFGS) method
      0 references
      super-linear convergence
      0 references
      0 references

      Identifiers