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

DOI10.1007/S11590-021-01792-3MaRDI QIDQ2128765zbMATH OpenOpenAlexFDO

Authors 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

convergenceglobal optimizationsmooth functions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• On convergence rate of a rectangular partition based global optimization algorithm
• Convergence rates of subgradient methods for quasi-convex optimization problems
• On the convergence of subproper (multi)-splitting methods for solving rectangular linear systems
• scientific article; zbMATH DE number 1981901
• Convergence Rate of an Optimization Algorithm for Minimizing Quadratic Functions with Separable Convex Constraints
• Convergence of a substructuring method with Lagrange multipliers
• Convergence of multivariate non-stationary vector subdivision schemes
• Convergence analysis of the fast subspace descent method for convex optimization problems
• Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
• Convergence Rate Analysis for the Alternating Direction Method of Multipliers with a Substitution Procedure for Separable Convex Programming

Cites work

• A \textsc{direct}-type global optimization algorithm for image registration
• A univariate global search working with a set of Lipschitz constants for the first derivative
• Algorithm 829
• From bandits to Monte-Carlo tree search: the optimistic principle applied to optimization and planning
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme
• Lipschitzian optimization without the Lipschitz constant
• Metaheuristic vs. deterministic global optimization algorithms: the univariate case
• On convergence rate of a rectangular partition based global optimization algorithm
• Univariate geometric Lipschitz global optimization algorithms

Cited in

(3)

• Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
• On convergence rate of a rectangular partition based global optimization algorithm
• Convergence analysis of a global optimization algorithm for centroid-based clustering

Describes a project that uses

Uses Software

• Algorithm 829

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

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