A deterministic algorithm for global optimization
From MaRDI portal
Publication:1803605
DOI10.1007/BF01581266zbMath0807.90103MaRDI QIDQ1803605
Publication date: 29 June 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Related Items
Global optimization on an interval, Customizing methods for global optimization -- a geometric viewpoint, A DIRECT-based approach exploiting local minimizations for the solution of large-scale global optimization problems, Random derivative-free algorithm for solving unconstrained or bound constrained continuously differentiable non-linear problems, Rigorous constraint satisfaction for sampled linear systems, Univariate global optimization with multiextremal non-differentiable constraints without penalty functions, A modification to the new version of the Price's algorithm for continuous global optimization problems, An algorithm for solving global optimization problems with nonlinear constraints, Constrained, Global Optimization of Unknown Functions with Lipschitz Continuous Gradients, Global optimization in clustering using hyperbolic cross points, Global optimization method with numerically calculated function derivatives, Novel local tuning techniques for speeding up one-dimensional algorithms in expensive global optimization using Lipschitz derivatives, A deterministic global optimization using smooth diagonal auxiliary functions, Lipschitz gradients for global optimization in a one-point-based partitioning scheme, An efficient implementation of parallel simulated annealing algorithm in GPUs, Likelihood Ratio Tests for a Large Directed Acyclic Graph, A partition-based global optimization algorithm, Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives, A concurrent implementation of the surrogate management framework with application to cardiovascular shape optimization, Self-adaptive randomized and rank-based differential evolution for multimodal problems, A new global optimization method for univariate constrained twice-differentiable NLP problems, Volumetric uncertainty bounds and optimal configurations for converging beam triple LIDAR, Large-Scale and Global Maximization of the Distance to Instability, Optimal switching between cash-flow streams, Parallel two-phase methods for global optimization on GPU, Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms, Remembering Leo Breiman, Basin hopping with synched multi L-BFGS local searches. Parallel implementation in multi-CPU and GPUs, Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties, Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms, On convergence of "divide the best" global optimization algorithms, Symbolic interval inference approach for subdivision direction selection in interval partitioning algorithms, Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations, Sequential importance sampling of binary sequences, Krylov subspace methods for discrete-time algebraic Riccati equations, Global optimization requires global information, A univariate global search working with a set of Lipschitz constants for the first derivative, Experiments with new stochastic global optimization search techniques, Global one-dimensional optimization using smooth auxiliary functions, A Subspace Framework for ${\mathcal H}_\infty$-Norm Minimization, Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization, Multidimensional global optimization using numerical estimates of objective function derivatives, Accelerations for a variety of global optimization methods, Accelerations for global optimization covering methods using second derivatives, On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients, A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems, An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Monte Carlo simulated annealing approach to optimization over continuous variables
- A multi-start global minimization algorithm with dynamic search trajectories
- Generalized descent for global optimization
- Global optimization by controlled random search
- A method of unconstrained global optimization
- The determination of the location of the global maximum of a function in the presence of several local extrema
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- An algorithm for finding the absolute extremum of a function
- A Sequential Method Seeking the Global Maximum of a Function
