Dissertation > Excellent graduate degree dissertation topics show

Research on Broyden algorithm for non convex function

Author: ZhongHai
Tutor: CaiZhiJie
School: Fudan University
Course: Applied Mathematics
Keywords: quasi-Newton methods Broyden class non-convex function globalconvergence
CLC: O224
Type: Master's thesis
Year: 2012
Downloads: 7
Quote: 0
Read: Download Dissertation


In this paper, we study global convergence properties of Broyden class of quasi-Newton methods, when applied to non-convex functions. First we state some fundamen-tal properties of quasi-Newton methods, especially Broyden class. Then we focus on the convergence property of this method when applied to non-convex functions. In this part we originally give a condition and prove that in this condition the methods of Broyden class ((?)≠1) can converge globally when applied to non-convex function. Under certain conditions, we also establish superlinear convergence of this class of methods. Next, we consider a well-known condition that has already been the sufficient condition of conver-gence of BFGS method. We prove that this condition can also be the sufficient condition of convergence of Broyden class{(?≠1) of methods. Finally we show some numerical examples of this class of methods. The results show that Broyden class of methods are adaptive to non-convex functions.

Related Dissertations

  1. A Modified Quasi-Newton Method and It’s Convergence,O224
  2. A Quasi -Newton method and conjugate gradient method study of non- monotonic line search,O224
  3. A Class of New Factorized Quasi-Newton Methods for Nonlinear Least Squares Problems,O242.2
  4. Nonmonotone trust region method for unconstrained optimization of Perry-Shanno memoryless quasi-Newton method,O224
  5. Broyden’s Class of Modified Quasi-Newton Methods and Their Applications,O224
  6. Improvement on Conjugate Gradient Method,O224
  7. The research of modified Newton and quasi-Newton algorithms,O224
  8. On the Methods for Unconstrained Optimization Problems and Their Realizes,O224
  9. Filter Trust Region Algorithms for Unconstrained Optimization,O224
  10. A Proximal Bundle Method for Nonsmooth and Nonconvex Constrained Optimization,O224
  11. A Class of Descent Nonlinear Conjugate Gradient Methods,O224
  12. Several Kinds of Methods for Solving Bound Constrained Optimization Problems,O224
  13. Quasi-Newton Methods and Their Convergence Properties,O241
  14. Optimization Methods for Finding Periodic Solutions of Differential Equations,O224
  15. Nonmonotone BFGS Method for Nonconvex Unconstrained Optimization,O242.23
  16. Algorithm of Synthetic Aperture Radar Image Formation,TN958
  17. Hessian algorithm for a class of nonlinear equality constrained optimization problem irreducible,O224
  18. The Convergence of Quasi-Newton Methods,O242.23
  19. The optimal scale of investment of private equity funds,O224
  20. A Smoothing Method for Solving Model under WCVarR,O224
  21. Mining resources based on genetic algorithm optimization model of,O224

CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Optimization of the mathematical theory
© 2012 www.DissertationTopic.Net  Mobile