Global optimization
From MaRDI portal
From the Contents: 1. Introduction (The global optimization problem, covering methods), 2. Covering Methods (basic covering methods, branch- and-bound type methods, internal methods, algorithms based on integral representation), 3. Methods of Generalized Descent (the Branin method, the tunneling method), 4. Random Search Methods, 5. Clustering Methods, 6. Methods Based on Statistical Models of Objective Functions, 7. Miscellaneous (parallel global optimization, heuristic methods), 8. Testing and Applications (one-dimensional algorithms, multidimensional algorithms, test problems, applications to practical problems). The aim of the authors, formulated in the preface, has been attained: ``The book is written to stimulate the research in the field, and to promote the use of global optimization methods by giving an introduction to different approaches..
Recommendations
Cited in
(only showing first 100 items - show all)- Dynamic globally concavized filled function method for continuous global optimization
- Synthesis of the \(\beta\)-distribution as an aid to stochastic global optimization
- A global simulated annealing heuristic for the three-parameter lognormal maximum likelihood estimation
- A univariate global search working with a set of Lipschitz constants for the first derivative
- GMG -- a guaranteed global optimization algorithm: application to remote sensing
- Reformulation in mathematical programming: An application to quantum chemistry
- The EOQ problem with decidable warehouse capacity: Analysis, solution approaches and applications
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points
- Global optimization algorithms for a CAD workstation
- GAS, a concept on modeling species in genetic algorithms
- Stochastic techniques for global optimization: A survey of recent advances
- Generalized bilinear programming: An application in farm management
- Tactical design of rail freight networks. II: Local search methods with statistical analysis
- A tabu search Hooke and Jeeves algorithm for unconstrained optimization
- Two strategies of adaptive cluster covering with descent and their comparison to other algorithms
- Global one-dimensional optimization using smooth auxiliary functions
- A Newton-type univariate optimization algorithm for locating the nearest extremum
- Asymptotics for the random coupon collector problem
- Parallel computing in nonconvex programming
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Isotropic effective energy simulated annealing searches for low energy molecular cluster states
- Primal-relaxed dual global optimization approach
- A parallel method for finding the global minimum of univariate functions
- On the role of continuously differentiable exact penalty functions in constrained global optimization
- Topographical global optimization using pre-sampled points
- Topographical multilevel single linkage
- An improvement on Fibonacci search method in optimization theory.
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
- Global optimization based on a statistical model and simplicial partitioning.
- A new filled function applied to global optimization.
- The barrier attribute of filled functions.
- Least squares splines with free knots: Global optimization approach.
- Experiments with new stochastic global optimization search techniques
- A large step random walk for minimizing total weighted tardiness in a job shop
- Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization
- Multilayer perceptron for nonlinear programming
- Asynchronously parallel optimization solver for finding multiple minima
- A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization
- Basin hopping networks of continuous global optimization problems
- Best practices for comparing optimization algorithms
- Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space
- Optimization of black-box problems using Smolyak grids and polynomial approximations
- Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems
- RBFOpt: an open-source library for black-box optimization with costly function evaluations
- Efficient multicriterial optimization based on intensive reuse of search information
- TRIOPT: A triangulation-based partitioning algorithm for global optimization
- Quasi-random initial population for genetic algorithms
- The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization
- Some experiments on heuristic code selection versus numerical performance in nonlinear programming
- The impact of accelerating tools on the interval subdivision algorithm for global optimization
- Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.
- The impelling function method applied to global optimization
- A computable filled function used for global minimization
- Several filled functions with mitigators.
- A stochastic approach to global optimization of nonlinear programming problem with many equality constraints
- Population set-based global optimization algorithms: some modifications and numerical studies
- A branch-and-bound algorithm for bound constrained optimization problems without derivatives
- An adaptive stochastic global optimization algorithm for one-dimensional functions
- An algorithm for solving global optimization problems with nonlinear constraints
- Parallel genetic algorithms with local search
- Global optimization with a limited solution time
- Genetic algorithms with noisy fitness
- A branch-and-reduce approach to global optimization
- Derivative-free methods for bound constrained mixed-integer optimization
- An information global minimization algorithm using the local improvement technique
- A lower bound on convergence rates of nonadaptive algorithms for univariate optimization with noise
- Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
- Global optimization with space-filling curves.
- \textsc{Oscars}-II: an algorithm for bound constrained global optimization
- Multistart with early termination of descents
- Global optimization via inverse distance weighting and radial basis functions
- Efficient large scale global optimization through clustering-based population methods
- Novel global optimization algorithm with a space-filling curve and integral function
- On solving bilevel optimization problems with a nonconvex lower level: the case of a bimatrix game
- EO-MTRNN: evolutionary optimization of hyperparameters for a neuro-inspired computational model of spatiotemporal learning
- A surrogate-based cooperative optimization framework for computationally expensive black-box problems
- Computationally efficient approach for solving lexicographic multicriteria optimization problems
- Global optimization of protein-peptide docking by a filling function method
- A batch, derivative-free algorithm for finding multiple local minima
- Global optimization on an interval
- Consistency of a myopic Bayesian algorithm for one-dimensional global optimization
- A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems
- New formulations for the Kissing Number Problem
- Solving nonlinearly constrained global optimization problem via an auxiliary function method
- On estimating workload in interval branch-and-bound global optimization algorithms
- A hybrid global optimization algorithm for nonlinear least squares regression
- Examples of inconsistency in optimization by expected improvement
- Pseudo expected improvement criterion for parallel EGO algorithm
- Small sample uniformity in random number generation
- Parallel hybrid algorithm for global optimization of problems occurring in MDS-based visualization
- On the efficient computation of robust regression estimators
- Multi-dimensional pruning from the Baumann point in an interval global optimization algorithm
- A new class of test functions for global optimization
- Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes
- A global minimization algorithm for Lipschitz functions
- A new extension of Piyavskii's method to Hölder functions of several variables
- A discrete EOQ problem is solvable in \(O(\log n)\) time
- Commutativity as prior knowledge in fuzzy modeling
- Application of deterministic low-discrepancy sequences in global optimization
This page was built for publication: Global optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5905474)
