Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions

DOI10.1007/s11590-021-01792-3zbMath1491.90137OpenAlexW3197313134MaRDI QIDQ2128765

Yanyan Li

Publication date: 22 April 2022

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-021-01792-3

zbMATH Keywords

global optimizationconvergencesmooth functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Uses Software

• Algorithm 829

Cites Work

• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• Univariate geometric Lipschitz global optimization algorithms
• A univariate global search working with a set of Lipschitz constants for the first derivative
• Lipschitzian optimization without the Lipschitz constant
• On convergence rate of a rectangular partition based global optimization algorithm
• A \textsc{direct}-type global optimization algorithm for image registration
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case
• From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planning
• Algorithm 829

This page was built for publication: Convergence rate of a rectangular subdivision-based optimization algorithm for smooth multivariate functions