A double parameter self-scaling memoryless BFGS method for unconstrained optimization
From MaRDI portal
Publication:2190850
Recommendations
- A double parameter scaled BFGS method for unconstrained optimization
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- Analysis of a self-scaling quasi-Newton method
- An adaptive scaled BFGS method for unconstrained optimization
Cites work
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- An adaptive scaled BFGS method for unconstrained optimization
- Analysis of a self-scaling quasi-Newton method
- Benchmarking optimization software with performance profiles.
- Conjugate Gradient Methods with Inexact Searches
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- CUTE
- Eigenvalues versus singular values study in conjugate gradient algorithms for large-scale unconstrained optimization
- Global and superlinear convergence of a restricted class of self-scaling methods with inexact line searches, for convex functions
- scientific article; zbMATH DE number 88930 (Why is no real title available?)
- Matrix conditioning and nonlinear optimization
- Numerical expirience with a class of self-scaling quasi-Newton algorithms
- On the limited memory BFGS method for large scale optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Optimization theory and methods. Nonlinear programming
- Self-Scaling Variable Metric (SSVM) Algorithms
- Unified approach to quadratically convergent algorithms for function minimization
- Updating Quasi-Newton Matrices with Limited Storage
Cited in
(11)- A double-parameter scaling Broyden-Fletcher-Goldfarb-Shanno method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization
- A double parameter scaled BFGS method for unconstrained optimization
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- New conjugate gradient algorithms based on self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method
- A modified scaling parameter for the memoryless BFGS updating formula
- A conjugate direction implementation of the BFGS algorithm with automatic scaling
- A hybrid scaling parameter for the scaled memoryless BFGS method based on the _ matrix norm
- A new version of augmented self-scaling BFGS method
- A new self-scaling memoryless quasi-Newton update for unconstrained optimization
- A three-parameter scaled memoryless BFGS method for parameter estimation and its applications
- Another three-term conjugate gradient method close to the memoryless BFGS for large-scale unconstrained optimization problems
This page was built for publication: A double parameter self-scaling memoryless BFGS method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2190850)
