A limited memory BFGS-type method for large-scale unconstrained optimization
From MaRDI portal
Publication:1004767
DOI10.1016/J.CAMWA.2008.01.028zbMATH Open1155.90441OpenAlexW1968874483MaRDI QIDQ1004767FDOQ1004767
Yunhai Xiao, Zengxin Wei, Zhiguo Wang
Publication date: 12 March 2009
Published in: Computers & Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2008.01.028
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- CUTE
- Benchmarking optimization software with performance profiles.
- On the limited memory BFGS method for large scale optimization
- Updating Quasi-Newton Matrices with Limited Storage
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- New quasi-Newton methods for unconstrained optimization problems
- Truncated-Newton algorithms for large-scale unconstrained optimization
- On the Local and Superlinear Convergence of Quasi-Newton Methods
- A modified BFGS method and its global convergence in nonconvex minimization
- New quasi-Newton equation and related methods for unconstrained optimization
- The BFGS method with exact line searches fails for non-convex objective functions
- The superlinear convergence of a modified BFGS-type method for unconstrained optimization
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- On the global convergence of the BFGS method for nonconvex unconstrained optimization problems
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- Convergence Properties of the BFGS Algoritm
- Numerical methods for large-scale nonlinear optimization
- A survey of truncated-Newton methods
Cited In (33)
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
- A modified PRP conjugate gradient algorithm with nonmonotone line search for nonsmooth convex optimization problems
- A new method with sufficient descent property for unconstrained optimization
- A limited memory \(q\)-BFGS algorithm for unconstrained optimization problems
- A compact limited memory method for large scale unconstrained optimization
- A family of quasi-Newton methods for unconstrained optimization problems
- A new adaptive trust region algorithm for optimization problems
- Title not available (Why is that?)
- A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem
- Global convergence of a modified two-parameter scaled BFGS method with Yuan-Wei-Lu line search for unconstrained optimization
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- Shifted limited-memory variable metric methods for large-scale unconstrained optimization
- A conjugate directions approach to improve the limited-memory BFGS method
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- An active set limited memory BFGS algorithm for large-scale bound constrained optimization
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- Improved Hessian approximations for the limited memory BFGS method
- Limited memory BFGS algorithm for the matrix approximation problem in Frobenius norm
- A simple sufficient descent method for unconstrained optimization
- Title not available (Why is that?)
- A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- A limited memory adaptive trust-region approach for large-scale unconstrained optimization
- Ensemble of physics-informed neural networks for solving plane elasticity problems with examples
- Limited-memory common-directions method for large-scale optimization: convergence, parallelization, and distributed optimization
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
- Modified subspace limited memory BFGS algorithm for large-scale bound constrained optimization
- A modified limited memory BFGS method for large-scale optimization
- On the limited memory BFGS method for large scale optimization
- Limited memory BFGS method based on a high-order tensor model
- Limited memory BFGS method for least squares semidefinite programming with banded structure
- A regularized limited memory BFGS method for nonconvex unconstrained minimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
Uses Software
This page was built for publication: A limited memory BFGS-type method for large-scale unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1004767)
