Convergence rates of a global optimization algorithm

DOI10.1007/BF01586051zbMath0756.90082OpenAlexW2015911097MaRDI QIDQ1186279

Regina Hunter Mladineo

Publication date: 28 June 1992

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01586051

zbMATH Keywords

superlinear convergenceLipschitz functionsbest and worst case analysis

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Convergence of line search methods for unconstrained optimization, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, New LP bound in multivariate Lipschitz optimization: Theory and applications, An algorithm for solving global optimization problems with nonlinear constraints, Multidimensional bisection: the performance and the context

Cites Work

• Unnamed Item
• Unnamed Item
• Multidimensional bisection applied to global optimisation
• Inclusion functions and global optimization
• An algorithm for finding the global maximum of a multimodal, multivariate function
• An algorithm for finding the absolute extremum of a function
• A Sequential Method Seeking the Global Maximum of a Function
• A stochastic algorithm for extremum search, optimal in one step