Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems

DOI10.4208/AAMM.2016.M1481zbMATH Open1488.90235OpenAlexW2569310384MaRDI QIDQ5155232FDOQ5155232

Yunqing Huang, Kai Jiang

Publication date: 6 October 2021

Published in: Advances in Applied Mathematics and Mechanics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/aamm.2016.m1481

Recommendations

• A class of convergent generalized hill climbing algorithms
• Hill Climbing with Multiple Local Optima
• Optimal search strategies using simultaneous generalized hill climbing algorithms
• On the convergence of generalized hill climbing algorithms
• A convergence analysis of generalized hill climbing algorithms
• Tabu guided generalized Hill climbing algorithms
• scientific article
• Stochastic enforced hill-climbing
• Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems

zbMATH Keywords

direct search algorithmsearch radiusstick hill-climbing algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• UOBYQA: unconstrained optimization by quadratic approximation
• `` Direct Search Solution of Numerical and Statistical Problems
• Title not available (Why is that?)
• A Simplex Method for Function Minimization
• Optimization theory and methods. Nonlinear programming
• Title not available (Why is that?)
• Trust Region Methods
• Title not available (Why is that?)
• On the Convergence of Pattern Search Algorithms
• Introduction to Derivative-Free Optimization
• Title not available (Why is that?)
• Direct Search Based on Probabilistic Descent
• Title not available (Why is that?)
• Direct search methods: Then and now
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• On trust region methods for unconstrained minimization without derivatives
• Sobolev seminorm of quadratic functions with applications to derivative-free optimization
• Direct Search Methods on Parallel Machines
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization

Cited In (2)

• A class of convergent generalized hill climbing algorithms
• Cross-Hill: a heuristic method for global optimization

Uses Software

• COBYLA2
• UOBYQA

This page was built for publication: Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5155232)