A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
From MaRDI portal
Publication:2346397
Recommendations
- Global convergence of a modified BFGS-type method for unconstrained non-convex minimization
- A modified nonmonotone BFGS algorithm for unconstrained optimization
- Global convergence of a modified limited memory BFGS method for non-convex minimization
- Global convergence properties of two modified BFGS-type methods
- Global convergence of nonsingular Broyden's method for solving unconstrained optimizations
Cites work
- scientific article; zbMATH DE number 3843083 (Why is no real title available?)
- scientific article; zbMATH DE number 3526471 (Why is no real title available?)
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- CUTEr and SifDec
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New quasi-Newton equation and related methods for unconstrained optimization
- New quasi-Newton methods for unconstrained optimization problems
- On the Convergence of a New Conjugate Gradient Algorithm
- Properties and numerical performance of quasi-Newton methods with modified quasi-Newton equations
- Restart procedures for the conjugate gradient method
- Self-Scaling Variable Metric (SSVM) Algorithms
- Self-Scaling Variable Metric (SSVM) Algorithms
Cited in
(36)- Two improved nonlinear conjugate gradient methods with the strong Wolfe line search
- A spectral three-term Hestenes-Stiefel conjugate gradient method
- Superlinear convergence of nonlinear conjugate gradient method and scaled memoryless BFGS method based on assumptions about the initial point
- Two families of self-adjusting spectral hybrid DL conjugate gradient methods and applications in image denoising
- Memoryless quasi-Newton methods based on the spectral-scaling Broyden family for Riemannian optimization
- A descent hybrid conjugate gradient method based on the memoryless BFGS update
- On practical modifications of the quasi-Newton BFGS method
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems
- A three-term conjugate gradient method with accelerated subspace quadratic optimization
- An improved PRP type spectral conjugate gradient method with restart steps
- A class of CG algorithms overcoming jamming of the iterative solving process and its application in image restoration
- Inexact proximal memoryless quasi-Newton methods based on the Broyden family for minimizing composite functions
- A new conjugate gradient method with an efficient memory structure
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations
- A family of accelerated hybrid conjugate gradient method for unconstrained optimization and image restoration
- Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions
- An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
- A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations
- An efficient hybrid conjugate gradient method with an adaptive strategy and applications in image restoration problems
- A family of spectral conjugate gradient methods with strong convergence and its applications in image restoration and machine learning
- An adaptive three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Two classes of spectral conjugate gradient methods for unconstrained optimizations
- A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
- Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization
- Modified memoryless spectral-scaling Broyden family on Riemannian manifolds
- Two families of hybrid conjugate gradient methods with restart procedures and their applications
- An accelerated relaxed-inertial strategy based CGP algorithm with restart technique for constrained nonlinear pseudo-monotone equations to image de-blurring problems
- A modified two-parameter scaled Broyden-type algorithm for unconstrained optimization problems
- Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
- An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
- A modified scaling parameter for the memoryless BFGS updating formula
- A structured L-BFGS method and its application to inverse problems
- Two efficient spectral hybrid CG methods based on memoryless BFGS direction and Dai–Liao conjugacy condition
- An inertial spectral CG projection method based on the memoryless BFGS update
- An efficient hybrid conjugate gradient method with sufficient descent property for unconstrained optimization
This page was built for publication: A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2346397)
