A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems
From MaRDI portal
Publication:5193216
DOI10.1142/S0217595919500179zbMath1423.90140OpenAlexW2970723125MaRDI QIDQ5193216
Zheng Peng, Wen-Li Dong, Xing Li
Publication date: 9 September 2019
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0217595919500179
global convergenceBarzilai-Borwein gradient methodnonmonotone search techniquesimulated annealing rule
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Investigation of temperature parallel simulated annealing for optimizing continuous functions with application to hyperspectral tomography
- An extended nonmonotone line search technique for large-scale unconstrained optimization
- Proposal adaptation in simulated annealing for continuous optimization problems
- A nonmonotone inexact Newton method for unconstrained optimization
- R-linear convergence of the Barzilai and Borwein gradient method
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- Two-Point Step Size Gradient Methods
- Testing Unconstrained Optimization Software
- Algorithm 500: Minimization of Unconstrained Multivariate Functions [E4]
- Numerical Optimization
- CUTE
- A Nonmonotone Line Search Technique for Newton’s Method
- Equation of State Calculations by Fast Computing Machines
- An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
- On the Barzilai and Borwein choice of steplength for the gradient method
- A Nonlinear Conjugate Gradient Algorithm with an Optimal Property and an Improved Wolfe Line Search
- Benchmarking optimization software with performance profiles.
- Adaptive two-point stepsize gradient algorithm
This page was built for publication: A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems
