An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
From MaRDI portal
Publication:5277958
DOI10.1080/02331934.2017.1287702zbMath1375.90285OpenAlexW2587204848MaRDI QIDQ5277958
Hadi Nosratipour, Akbar Hashemi Borzabadi, Omid Solaymani Fard
Publication date: 12 July 2017
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2017.1287702
Related Items (4)
An efficient gradient method with approximately optimal stepsize based on tensor model for unconstrained optimization ⋮ An efficient nonmonotone method for state-constrained elliptic optimal control problems ⋮ A Simulated Annealing-Based Barzilai–Borwein Gradient Method for Unconstrained Optimization Problems ⋮ A nonmonotone line search for the LBFGS method in parabolic optimal control problems
Uses Software
Cites Work
- A modified Hestenes and Stiefel conjugate gradient algorithm for large-scale nonsmooth minimizations and nonlinear equations
- Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search
- On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
- Notes on the Dai-Yuan-Yuan modified spectral gradient method
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- A globally convergent and efficient method for unconstrained discrete-time optimal control
- A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- A nonmonotone inexact Newton method for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Minimization of functions having Lipschitz continuous first partial derivatives
- R-linear convergence of the Barzilai and Borwein gradient method
- A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
- THE BARZILAI AND BORWEIN GRADIENT METHOD WITH NONMONOTONE LINE SEARCH FOR NONSMOOTH CONVEX OPTIMIZATION PROBLEMS
- A class of nonmonotone Armijo-type line search method for unconstrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- ADAPTIVE ALGORITHMS FOR NEURAL NETWORK SUPERVISED LEARNING: A DETERMINISTIC OPTIMIZATION APPROACH
- Two-Point Step Size Gradient Methods
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- CUTEr and SifDec
- Methods of conjugate gradients for solving linear systems
- A new nonmonotone line search technique for unconstrained optimization
- Benchmarking optimization software with performance profiles.
- On the nonmonotone line search
This page was built for publication: An adaptive nonmonotone global Barzilai–Borwein gradient method for unconstrained optimization
