Hill-Climbing Algorithm with a Stick for Unconstrained Optimization Problems

DOI10.4208/aamm.2016.m1481zbMath1488.90235OpenAlexW2569310384MaRDI QIDQ5155232

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)

Uses Software

• COBYLA2
• UOBYQA

Cites Work

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

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