Simulated annealing-based nonmonotone conjugate gradient method for unconstrained optimization with applications
From MaRDI portal
Cites work
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- A derivative-free nonmonotone line-search technique for unconstrained optimization
- A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
- A modified HZ conjugate gradient algorithm without gradient Lipschitz continuous condition for non convex functions
- A modified self-scaling memoryless Broyden-Fletcher-Goldfarb-Shanno method for unconstrained optimization
- A new class of conjugate gradient methods for unconstrained smooth optimization and absolute value equations
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A new family of hybrid three-term conjugate gradient methods with applications in image restoration
- A new nonmonotone line search technique for unconstrained optimization
- A non-monotone line search algorithm for unconstrained optimization
- A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A simulated annealing-based Barzilai-Borwein gradient method for unconstrained optimization problems
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- An efficient Barzilai-Borwein conjugate gradient method for unconstrained optimization
- An unconstrained optimization test functions collection
- Benchmarking optimization software with performance profiles.
- Convergence Conditions for Ascent Methods
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- Efficient generalized conjugate gradient algorithms. I: Theory
- Function minimization by conjugate gradients
- Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
- Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 3439906 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization
- Hybrid spectral gradient method for the unconstrained minimization problem
- Methods of conjugate gradients for solving linear systems
- Minimization of functions having Lipschitz continuous first partial derivatives
- Multivariate spectral gradient method for unconstrained optimization
- New cautious BFGS algorithm based on modified Armijo-type line search
- New conjugacy conditions and related nonlinear conjugate gradient methods
- New quasi-Newton methods for unconstrained optimization problems
- Nonmonotone line search methods with variable sample size
- On an iterative method for solving absolute value equations
- On efficiency of nonmonotone Armijo-type line searches
- On the SOR-like iteration method for solving absolute value equations
- Optimization by simulated annealing
- Solving unconstrained optimization problems via hybrid CD-DY conjugate gradient methods with applications
- The conjugate gradient method in extremal problems
- The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
This page was built for publication: Simulated annealing-based nonmonotone conjugate gradient method for unconstrained optimization with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7404351)
