Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
Summary: The BFGS method is one of the most efficient quasi-Newton methods for solving small- and medium-size unconstrained optimization problems. For the sake of exploring its more interesting properties, a modified two-parameter scaled BFGS method is stated in this paper. The intention of the modified scaled BFGS method is to improve the eigenvalues structure of the BFGS update. In this method, the first two terms and the last term of the standard BFGS update formula are scaled with two different positive parameters, and the new value of \(y_k\) is given. Meanwhile, Yuan-Wei-Lu line search is also proposed. Under the mentioned line search, the modified two-parameter scaled BFGS method is globally convergent for nonconvex functions. The extensive numerical experiments show that this form of the scaled BFGS method outperforms the standard BFGS method or some similar scaled methods.
- A double parameter scaled BFGS method for unconstrained optimization
- An adaptive scaled BFGS method for unconstrained optimization
- A modified scaling BFGS method for nonconvex minimization
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- Global convergence properties of two modified BFGS-type methods
- A class of parameter estimation methods for nonlinear Muskingum model using hybrid invasive weed optimization algorithm
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- A derivative-free conjugate residual method using secant condition for general large-scale nonlinear equations
- A double parameter scaled BFGS method for unconstrained optimization
- A family of quasi-Newton methods for unconstrained optimization problems
- A hybrid MBFGS and CBFGS method for nonconvex minimization with a global complexity bound
- A limited memory BFGS-type method for large-scale unconstrained optimization
- A Modified BFGS Algorithm for Unconstrained Optimization
- A modified BFGS method and its global convergence in nonconvex minimization
- A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems
- A modified Broyden-like quasi-Newton method for nonlinear equations
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A short note on the global convergence of the unmodified PRP method
- A stochastic quasi-Newton method for large-scale optimization
- Algorithm 778: L-BFGS-B
- An adaptive scaled BFGS method for unconstrained optimization
- Analysis of a self-scaling quasi-Newton method
- Convergence analysis of a modified BFGS method on convex minimizations
- Convergence Properties of the BFGS Algoritm
- CUTE
- Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global convergence of a new hybrid Gauss-Newton structured BFGS method for nonlinear least squares problems
- Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
- How bad are the BFGS and DFP methods when the objective function is quadratic?
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- New quasi-Newton methods for unconstrained optimization problems
- Nonsmooth optimization via quasi-Newton methods
- On the Behavior of Broyden’s Class of Quasi-Newton Methods
- On the Convergence of the Variable Metric Algorithm
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- Self-Scaling Variable Metric (SSVM) Algorithms
- Spectral scaling BFGS method
- Testing Unconstrained Optimization Software
- The BFGS method with exact line searches fails for non-convex objective functions
- The convergence of a new modified BFGS method without line searches for unconstrained optimization or complexity systems
- The global convergence of a modified BFGS method for nonconvex functions
- The global convergence of partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
- The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- Two-Point Step Size Gradient Methods
- Updating conjugate directions by the BFGS formula
- Variable metric algorithms: Necessary and sufficient conditions for identical behaviour of nonquadratic functions
- Variational quasi-Newton methods for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- Global convergence property of scaled two-step BFGS method
- The global convergence of the BFGS method under a modified Yuan-Wei-Lu line search technique
- A comparative study of modified BFGS and scale modified BFGS
- Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
- A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
- An adaptive scaled BFGS method for unconstrained optimization
This page was built for publication: Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2007164)
