Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
From MaRDI portal
Recommendations
- The modified BFGS method with new secant relation for unconstrained optimization problems
- A new modified BFGS method 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 conjugate gradient method based on a modified secant relation for unconstrained optimization
Cites work
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- 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 nonlinear model for function-value multistep methods
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Alternating multi-step quasi-Newton methods for unconstrained optimization
- 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
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- Multi-step quasi-Newton methods for optimization
- New quasi-Newton equation and related methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- New quasi-Newton methods via higher order tensor models
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Optimization theory and methods. Nonlinear programming
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Quasi-Newton Methods, Motivation and Theory
- 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 superlinear convergence of a modified BFGS-type method for unconstrained optimization
- Two new conjugate gradient methods based on modified secant equations
Cited in
(8)- On some Moser-type iterative methods with applications to nonlinear problems
- On an iterative Moser-Kurchatov method for solving systems of nonlinear equations
- Competition-based two-stage evolutionary algorithm for constrained multi-objective optimization
- An improved Dai-Liao-style hybrid conjugate gradient-based method for solving unconstrained nonconvex optimization and extension to constrained nonlinear monotone equations
- Speeding up L-BFGS by direct approximation of the inverse Hessian matrix
- A practical DIRECT-type algorithm for medium-scale black-box global optimization
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- A second-derivative-free modified secant-like method with order 2.732\dots\ for unconstrained optimization
This page was built for publication: Competitive secant (BFGS) methods based on modified secant relations for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174641)
