A new modified BFGS method for unconstrained optimization problems
From MaRDI portal
Publication:1993498
Recommendations
- The modified BFGS method with new secant relation for unconstrained optimization problems
- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- Using a modied secant equation for unconstrained optimization
- A class of modified BFGS methods with function value information for unconstrained optimization
- A nonmonotone modified BFGS algorithm for nonconvex unconstrained optimization problems
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Class of Methods for Solving Nonlinear Simultaneous Equations
- A Family of Variable-Metric Methods Derived by Variational Means
- A modified BFGS method and its global convergence in nonconvex minimization
- A new approach to variable metric algorithms
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Benchmarking optimization software with performance profiles.
- BFGS trust-region method for symmetric nonlinear equations
- Conditioning of Quasi-Newton Methods for Function Minimization
- Convergence analysis of a modified BFGS method on convex minimizations
- Convergence Properties of the BFGS Algoritm
- CUTEr and SifDec
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Global convergence of the partitioned BFGS algorithm for convex partially separable optimization
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 3529352 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- New quasi-Newton equation and related methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- Nonmonotone backtracking inexact quasi-Newton algorithms for solving smooth nonlinear equations
- On the construction of minimization methods of quasi-Newton type
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- The BFGS method with exact line searches fails for non-convex objective functions
- The Convergence of a Class of Double-rank Minimization Algorithms
- 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
- Variable metric methods of minimisation
Cited in
(8)- Using nonlinear functions to approximate a new quasi-Newton method for unconstrained optimization problems
- A class of modified BFGS methods with function value information for unconstrained optimization
- The modified BFGS method with new secant relation for unconstrained optimization problems
- Using a modied secant equation for unconstrained optimization
- scientific article; zbMATH DE number 5196186 (Why is no real title available?)
- Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
- A modified secant method for unconstrained optimization
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
This page was built for publication: A new modified BFGS method for unconstrained optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1993498)
