Using a modied secant equation for unconstrained optimization
From MaRDI portal
Recommendations
- A new modified BFGS method for unconstrained optimization problems
- A modified conjugate gradient method based on a modified secant equation
- A modified BFGS algorithm based on a hybrid secant equation
- The modified BFGS method with new secant relation for unconstrained optimization problems
- A modified conjugate gradient method for unconstrained optimization
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 new modified BFGS method for unconstrained optimization problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Benchmarking optimization software with performance profiles.
- 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 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?)
- New quasi-Newton equation and related methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- 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 partitioned BFGS on problems with convex decompositions and Lipschitzian gradients
Cited in
(4)- A new modified BFGS method for unconstrained optimization problems
- The modified BFGS method with new secant relation for unconstrained optimization problems
- Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
- A modified BFGS algorithm based on a hybrid secant equation
This page was built for publication: Using a modied secant equation for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151745)
