Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems

DOI10.4208/AAMM.2016.M1481MaRDI QIDQ5155232zbMATH OpenOpenAlexFDO

Authors 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

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)

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; zbMATH DE number 5072445
• Stochastic enforced hill-climbing
• Simultaneous generalized hill-climbing algorithms for addressing sets of discrete optimization problems

Cites work

• scientific article; zbMATH DE number 2130220 (Why is no real title available?)
• scientific article; zbMATH DE number 976350 (Why is no real title available?)
• scientific article; zbMATH DE number 2002582 (Why is no real title available?)
• scientific article; zbMATH DE number 783783 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• A Simplex Method for Function Minimization
• A heuristic iterated-subspace minimization method with pattern search for unconstrained optimization
• Derivative-free optimization: a review of algorithms and comparison of software implementations
• Direct Search Methods on Parallel Machines
• Direct search based on probabilistic descent
• Direct search methods: Then and now
• Introduction to Derivative-Free Optimization
• On the Convergence of Pattern Search Algorithms
• On trust region methods for unconstrained minimization without derivatives
• Optimization theory and methods. Nonlinear programming
• Sobolev seminorm of quadratic functions with applications to derivative-free optimization
• Trust Region Methods
• UOBYQA: unconstrained optimization by quadratic approximation
• `` Direct Search Solution of Numerical and Statistical Problems

Cited in

(2)

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

Describes a project that uses

Uses Software

• UOBYQA
• COBYLA2

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)