Global optimization
From MaRDI portal
Publication:5905474
zbMath0752.90075MaRDI QIDQ5905474
Aimo A. Törn, Antanas Žilinskas
Publication date: 17 September 1992
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
global optimizationclusteringbranch-and-boundrandom searchheuristic methodscovering methodsmethods of generalized descent
Nonlinear programming (90C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (only showing first 100 items - show all)
On the role of continuously differentiable exact penalty functions in constrained global optimization ⋮ Asynchronously parallel optimization solver for finding multiple minima ⋮ A stochastic approach to global optimization of nonlinear programming problem with many equality constraints ⋮ Topographical global optimization using pre-sampled points ⋮ Population set-based global optimization algorithms: some modifications and numerical studies ⋮ Niching with derandomized evolution strategies in artificial and real-world landscapes ⋮ Topographical multilevel single linkage ⋮ A second-order pruning step for verified global optimization ⋮ A quantum-inspired evolutionary algorithm using Gaussian distribution-based quantization ⋮ Basin hopping networks of continuous global optimization problems ⋮ Best practices for comparing optimization algorithms ⋮ Eidetic wolf search algorithm with a global memory structure ⋮ A distributed hierarchical genetic algorithm for efficient optimization and pattern matching ⋮ Adaptive nested optimization scheme for multidimensional global search ⋮ Differential evolution methods based on local searches ⋮ A branch-and-bound algorithm for bound constrained optimization problems without derivatives ⋮ An adaptive stochastic global optimization algorithm for one-dimensional functions ⋮ Computational investigation of simple memetic approaches for continuous global optimization ⋮ Efficient solution of many instances of a simulation-based optimization problem utilizing a partition of the decision space ⋮ A new exclusion test for finding the global minimum ⋮ Lion pride optimizer: an optimization algorithm inspired by lion pride behavior ⋮ Optimization of black-box problems using Smolyak grids and polynomial approximations ⋮ Computation of multiple global optima through chaotic ant swarm ⋮ CARTopt: a random search method for nonsmooth unconstrained optimization ⋮ Parallel radial basis function methods for the global optimization of expensive functions ⋮ GAS, a concept on modeling species in genetic algorithms ⋮ Batching deteriorating items with applications in computer communication and reverse logistics ⋮ Convergence guarantees for generalized adaptive stochastic search methods for continuous global optimization ⋮ An online AUC formulation for binary classification ⋮ Particle swarm optimization: Hybridization perspectives and experimental illustrations ⋮ An improvement on Fibonacci search method in optimization theory. ⋮ On strong homogeneity of two global optimization algorithms based on statistical models of multimodal objective functions ⋮ Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. ⋮ Global optimization based on a statistical model and simplicial partitioning. ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ A new filled function applied to global optimization. ⋮ An efficient simulation budget allocation method incorporating regression for partitioned domains ⋮ The barrier attribute of filled functions. ⋮ Least squares splines with free knots: Global optimization approach. ⋮ A one-step worst-case optimal algorithm for bi-objective univariate optimization ⋮ General variable neighborhood search for the continuous optimization ⋮ On a global optimization algorithm for bivariate smooth functions ⋮ Influence of ensemble surrogate models and sampling strategy on the solution quality of algorithms for~computationally expensive black-box global optimization problems ⋮ A filling function method for unconstrained global optimization ⋮ RBFOpt: an open-source library for black-box optimization with costly function evaluations ⋮ Global optimization of general constrained grey-box models: new method and its application to constrained PDEs for pressure swing adsorption ⋮ Dynamic algorithm selection for Pareto optimal set approximation ⋮ Adaptive approximation of the minimum of Brownian motion ⋮ The impatience mechanism as a diversity maintaining and saddle crossing strategy ⋮ Optimal switching between cash-flow streams ⋮ Balancing global and local search in parallel efficient global optimization algorithms ⋮ Moving-horizon state estimation for nonlinear discrete-time systems: new stability results and approximation schemes ⋮ Stochastic techniques for global optimization: A survey of recent advances ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Improving solution of discrete competitive facility location problems ⋮ TRIOPT: A triangulation-based partitioning algorithm for global optimization ⋮ Global optimizations and tabu search based on memory ⋮ Quasi-random initial population for genetic algorithms ⋮ The application of a unified Bayesian stopping criterion in competing parallel algorithms for global optimization ⋮ Randomized algorithm for global optimization with bounded memory ⋮ An exact D-dimensional Tsallis random number generator for generalized simulated annealing ⋮ Convergence properties of the expected improvement algorithm with fixed mean and covariance functions ⋮ Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms ⋮ Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints ⋮ On the genetic algorithm with adaptive mutation rate and selected statistical applications ⋮ 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 ⋮ SO-I: a surrogate model algorithm for expensive nonlinear integer programming problems including global optimization applications ⋮ Dynamic globally concavized filled function method for continuous global optimization ⋮ Genetic and Nelder--Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions. ⋮ Generalized bilinear programming: An application in farm management ⋮ 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 ⋮ Tactical design of rail freight networks. II: Local search methods with statistical analysis ⋮ A tabu search Hooke and Jeeves algorithm for unconstrained optimization ⋮ The impelling function method applied to global optimization ⋮ Experiments with new stochastic global optimization search techniques ⋮ A hybrid meta-heuristic for global optimisation using low-discrepancy sequences of points ⋮ Global one-dimensional optimization using smooth auxiliary functions ⋮ A Newton-type univariate optimization algorithm for locating the nearest extremum ⋮ A large step random walk for minimizing total weighted tardiness in a job shop ⋮ Finding optimal points for expensive functions using adaptive RBF-based surrogate model via uncertainty quantification ⋮ Asymptotics for the random coupon collector problem ⋮ A computable filled function used for global minimization ⋮ Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization ⋮ Parallel computing in nonconvex programming ⋮ Several filled functions with mitigators. ⋮ 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 ⋮ Multilayer perceptron for nonlinear programming ⋮ Primal-relaxed dual global optimization approach ⋮ A parallel method for finding the global minimum of univariate functions ⋮ Matching stochastic algorithms to objective function landscapes ⋮ One-dimensional global optimization for observations with noise
This page was built for publication: Global optimization
