The GLOBAL optimization method revisited

DOI10.1007/S11590-007-0072-3zbMath1160.90660DBLPjournals/ol/CsendesPSB08OpenAlexW2001833310WikidataQ59343622 ScholiaQ59343622MaRDI QIDQ941038

J. Oscar H. Sendín, Tibor Csendes, Julio R. Banga, László Pál

Publication date: 4 September 2008

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

Full work available at URL: https://doi.org/10.1007/s11590-007-0072-3

zbMATH Keywords

global optimizationclusteringnumerical testsdirect methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (17)

Using a derivative-free optimization method for multiple solutions of inverse transport problems ⋮ A batch, derivative-free algorithm for finding multiple local minima ⋮ Calibration by optimization without using derivatives ⋮ Efficient unconstrained black box optimization ⋮ Empirical study of the improved UNIRANDI local search method ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ On the utility of randomly generated functions for performance evaluation of evolutionary algorithms ⋮ Generalizing the sigmoid function using continuous-valued logic ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ GPU parameter tuning for tall and skinny dense linear least squares problems ⋮ Benchmarking nonlinear optimization software in technical computing environments ⋮ One side cut accelerated random search ⋮ Dynamic guiding particle swarm optimization with embedded chaotic search for solving multidimensional problems ⋮ A Metropolis algorithm combined with Hooke-Jeeves local search method applied to global optimization ⋮ \textsc{Oscars}-II: an algorithm for bound constrained global optimization ⋮ Mathematically rigorous global optimization in floating-point arithmetic

Cites Work

• Unnamed Item
• Unnamed Item
• New approaches to circle packing in a square. With program codes.
• Towards a computer-assisted proof for chaos in a forced damped pendulum equation
• Empirical convergence speed of inclusion functions for facility location problems
• Speeding up continuous GRASP
• Handbook of global optimization
• Some global optimization problems on Stiefel manifolds
• Greedy randomized adaptive search procedures
• Global optimization by continuous grasp
• A verified optimization technique to locate chaotic regions of Hénon systems
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context
• A stochastic method for global optimization
• OPTIMIZATION AND THE MIRANDA APPROACH IN DETECTING HORSESHOE-TYPE CHAOS BY COMPUTER
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Comparison of public-domain software for black box global optimization^∗
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems

This page was built for publication: The GLOBAL optimization method revisited