Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
From MaRDI portal
Publication:2267641
Recommendations
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- Scaled conjugate gradient algorithms for unconstrained optimization
Cites work
- scientific article; zbMATH DE number 992790 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A scaled nonlinear conjugate gradient algorithm for unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- Accelerated hybrid conjugate gradient algorithm with modified secant condition for unconstrained optimization
- Acceleration of conjugate gradient algorithms for unconstrained optimization
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Algorithm 851
- An acceleration of gradient descent algorithm with backtracking for unconstrained opti\-mi\-za\-tion
- An efficient hybrid conjugate gradient method for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- CUTE
- Conditioning of Quasi-Newton Methods for Function Minimization
- Conjugate Gradient Methods with Inexact Searches
- Conjugate gradient algorithms in nonconvex optimization
- Convergence Conditions for Ascent Methods
- Convergence Conditions for Ascent Methods. II: Some Corrections
- Convergence properties of the Beale-Powell restart algorithm
- Function minimization by conjugate gradients
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- Global convergence of the method of shortest residuals
- Matrix conditioning and nonlinear optimization
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New properties of a nonlinear conjugate gradient method
- New quasi-Newton equation and related methods for unconstrained optimization
- On the Convergence of a New Conjugate Gradient Algorithm
- On the convergence of conjugate gradient algorithms
- On the limited memory BFGS method for large scale optimization
- Optimal conditioning of self-scaling variable Metric algorithms
- Preconditioning of Truncated-Newton Methods
- Restart procedures for the conjugate gradient method
- Scaled conjugate gradient algorithms for unconstrained optimization
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- Self-Scaling Variable Metric (SSVM) Algorithms
- Some convergence properties of the conjugate gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Conjugate Gradient Method for Linear and Nonlinear Operator Equations
- The conjugate gradient method in extremal problems
Cited in
(45)- A nonmonotone scaled conjugate gradient algorithm for large-scale unconstrained optimization
- A modified spectral conjugate gradient method with global convergence
- The hybrid BFGS-CG method in solving unconstrained optimization problems
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A hybrid quasi-Newton method with application in sparse recovery
- A Five-Parameter Class of Derivative-Free Spectral Conjugate Gradient Methods for Systems of Large-Scale Nonlinear Monotone Equations
- A conjugate direction implementation of the BFGS algorithm with automatic scaling
- Two--parameter scaled memoryless BFGS methods with a nonmonotone choice for the initial step length
- A hybrid scaling parameter for the scaled memoryless BFGS method based on the _ matrix norm
- A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique
- A modified scaling parameter for the memoryless BFGS updating formula
- Two modified scaled nonlinear conjugate gradient methods
- A new modified scaled conjugate gradient method for large-scale unconstrained optimization with non-convex objective function
- An improved nonmonotone adaptive trust region method.
- A note on the global convergence theorem of the scaled conjugate gradient algorithms proposed by Andrei
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
- Accelerated conjugate gradient algorithm with finite difference Hessian/vector product approximation for unconstrained optimization
- A scaled BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae
- Spectral conjugate gradient methods for vector optimization problems
- A modified descent spectral conjugate gradient method for unconstrained optimization
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
- Two families of scaled three-term conjugate gradient methods with sufficient descent property for nonconvex optimization
- On the sufficient descent property of the Shanno's conjugate gradient method
- A new subspace minimization conjugate gradient method with nonmonotone line search for unconstrained optimization
- Improvements to steepest descent method for multi-objective optimization
- A modified scaled memoryless symmetric rank-one method
- Global convergence of a new sufficient descent spectral three-term conjugate gradient class for large-scale optimization
- A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update
- Scaled nonlinear conjugate gradient methods for nonlinear least squares problems
- A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization
- An adaptive nonmonotone trust region method based on a modified scalar approximation of the Hessian in the successive quadratic subproblems
- Extension of modified Polak-Ribière-Polyak conjugate gradient method to linear equality constraints minimization problems
- Scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
- A three-term conjugate gradient-type method with sufficient descent property for vector optimization
- Diagonally scaled memoryless quasi-Newton methods with application to compressed sensing
- Global convergence of a modified spectral three-term CG algorithm for nonconvex unconstrained optimization problems
- A conjugate gradient sampling method for nonsmooth optimization
- Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model
- Scaled memoryless BFGS preconditioned steepest descent method for very large-scale unconstrained optimization
- New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization
- A class of adaptive dai-liao conjugate gradient methods based on the scaled memoryless BFGS update
- A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization
This page was built for publication: Accelerated scaled memoryless BFGS preconditioned conjugate gradient algorithm for unconstrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2267641)
