An algorithm for finding the global maximum of a multimodal, multivariate function
From MaRDI portal
Publication:3734174
DOI10.1007/BF01580583zbMath0598.90075OpenAlexW2129250732MaRDI QIDQ3734174
Publication date: 1986
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580583
Related Items
A new parameter free filled function for solving unconstrained global optimization problems, On the convergence of global methods in multiextremal optimization, Cutting angle method – a tool for constrained global optimization, Customizing methods for global optimization -- a geometric viewpoint, Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization, A new filled function for global minimization and system of nonlinear equations, New LP bound in multivariate Lipschitz optimization: Theory and applications, Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints, Towards pure adaptive search, Global optimization of Hölder functions, On parallel branch and bound frameworks for global optimization, A filled function method with one parameter for unconstrained global optimization, A new filled function applied to global optimization., Topics in Lipschitz global optimisation, Least squares splines with free knots: Global optimization approach., Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints, Multidimensional bisection applied to global optimisation, An analytical approach to global optimization, Convergence rates of a global optimization algorithm, Reduction of indefinite quadratic programs to bilinear programs, Convergence qualification of adaptive partition algorithms in global optimization, Global optimization of univariate Lipschitz functions. I: Survey and properties, The bisection method in higher dimensions, Multidimensional bisection: the performance and the context, An application of Lipschitzian global optimization to product design, MSO: a framework for bound-constrained black-box global optimization algorithms, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, On tightness and anchoring of McCormick and other relaxations, On convergence of "divide the best" global optimization algorithms, Abstract convexity:examples and applications, A filled function method for global optimization with inequality constraints, Lipschitz programming via increasing convex-along-rays functions*, A deterministic algorithm for global optimization, Cutting angle methods in global optimization, Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces, Global optimization requires global information, A filled function which has the same local minimizer of the objective function, Geometry and combinatorics of the cutting angle method, Several filled functions with mitigators., Accelerations for a variety of global optimization methods, Accelerations for global optimization covering methods using second derivatives, Lipschitzian optimization without the Lipschitz constant, Multidimensional bisection: A dual viewpoint
Cites Work
