Global optimization requires global information

DOI10.1023/A:1022612511618MaRDI QIDQ1264973zbMATH OpenOpenAlexFDO

Authors K. Appert, C. P. Stephens, William Baritompa

Publication date 11 February 1999

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1022612511618, http://hdl.handle.net/10092/11614

zbMATH Keywords

convergencedeterministic algorithmsglobal optimizationstochastic algorithms

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 2200772
• On the asymptotic tractability of global optimization
• scientific article; zbMATH DE number 494358
• scientific article; zbMATH DE number 6276166
• An Information Global Optimization Algorithm with Local Tuning

Cites work

• A deterministic algorithm for global optimization
• A Sequential Method Seeking the Global Maximum of a Function
• An algorithm for finding the absolute extremum of a function
• An algorithm for finding the global maximum of a multimodal, multivariate function
• Cooling Schedules for Optimal Annealing
• Diffusions for Global Optimization
• Global optimization and stochastic differential equations
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
• scientific article; zbMATH DE number 3388498 (Why is no real title available?)
• Lipschitzian optimization without the Lipschitz constant
• Minimization by Random Search Techniques
• Multidimensional bisection applied to global optimisation
• On using estimates of Lipschitz constants in global optimization
• Optimization by simulated annealing

Cited in

(14)

• A univariate global search working with a set of Lipschitz constants for the first derivative
• Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
• On the extension of the \textsc{direct} algorithm to multiple objectives
• Using a derivative-free optimization method for multiple solutions of inverse transport problems
• A combined global \& local search (CGLS) approach to global optimization
• On the convergence of adaptive stochastic search methods for constrained and multi-objective black-box optimization
• Hybrid Behavioral-Based Multiobjective Space Trajectory Optimization
• Optimisation impossible
• Global search perspectives for multiobjective optimization
• Complexity of general continuous minimization problems: a survey
• Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization
• Comparative assessment of algorithms and software for global optimization
• A hybrid multiagent approach for global trajectory optimization
• A deterministic global optimization using smooth diagonal auxiliary functions

Describes a project that uses

Uses Software

• BRENT

This page was built for publication: Global optimization requires global information

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