Hybrid Krylov methods for nonlinear systems of equations
SIAM Journal on Scientific and Statistical Computing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Molecular conformations from distance matrices
Journal of Computational Chemistry
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Direct search methods for the molecular conformation problem
Journal of Computational Chemistry
Mathematical Programming: Series A and B
Gradient Method with Retards and Generalizations
SIAM Journal on Numerical Analysis
Estimation of the optical constants and the thickness of thin films using unconstrained optimization
Journal of Computational Physics
Algorithm 813: SPG—Software for Convex-Constrained Optimization
ACM Transactions on Mathematical Software (TOMS)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Modified Two-Point Stepsize Gradient Methods for Unconstrained Optimization
Computational Optimization and Applications
A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
SIAM Journal on Scientific Computing
The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
SIAM Journal on Optimization
Nonmonotone Spectral Projected Gradient Methods on Convex Sets
SIAM Journal on Optimization
On the nonmonotone line search
Journal of Optimization Theory and Applications
Journal of Computational and Applied Mathematics - Proceedings of the international conference on recent advances in computational mathematics
Introduction to Stochastic Search and Optimization
Introduction to Stochastic Search and Optimization
Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
Numerische Mathematik
On the asymptotic behaviour of some new gradient methods
Mathematical Programming: Series A and B
Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Classics in Applied Mathematics, 16)
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
Computers and Operations Research
| Hi-index | 0.00 |
We present a hybrid algorithm that combines a genetic algorithm with the Barzilai---Borwein gradient method. Under specific assumptions the new method guarantees the convergence to a stationary point of a continuously differentiable function, from any arbitrary initial point. Our preliminary numerical results indicate that the new methodology finds efficiently and frequently the global minimum, in comparison with the globalized Barzilai---Borwein method and the genetic algorithm of the Toolbox of Genetic Algorithms of MatLab.