A locally-biased form of the DIRECT algorithm.
From MaRDI portal
Publication:5959054
DOI10.1023/A:1017930332101zbMath1039.90049OpenAlexW1534033123MaRDI QIDQ5959054
Carl. T. Kelley, J. M. Gablonsky
Publication date: 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017930332101
Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (72)
Derivative-free global ship design optimization using global/local hybridization of the DIRECT algorithm ⋮ Asynchronous parallel hybrid optimization combining DIRECT and GSS ⋮ Diagonal generalizaton of the DIRECT method for problems with constraints ⋮ A new sampling method in the DIRECT algorithm ⋮ DIRECT algorithm: A new definition of potentially optimal hyperrectangles ⋮ Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO ⋮ Parallel global optimization on GPU ⋮ Test problem generator for unconstrained global optimization ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ Additive scaling and the \texttt{DIRECT} algorithm ⋮ Linear scaling and the DIRECT algorithm ⋮ Derivative-free optimization: a review of algorithms and comparison of software implementations ⋮ Modeling forest tree data using sequential spatial point processes ⋮ Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Modified DIRECT Algorithm for Scaled Global Optimization Problems ⋮ A modification of the \texttt{DIRECT} method for Lipschitz global optimization for a symmetric function ⋮ Lipschitz global optimization methods in control problems ⋮ Determination of protein structure and dynamics combining immune algorithms and pattern search methods ⋮ Adaptive block coordinate DIRECT algorithm ⋮ Complex portfolio selection via convex mixed‐integer quadratic programming: a survey ⋮ Branch-and-Model: a derivative-free global optimization algorithm ⋮ Bound-constrained global optimization of functions with low effective dimensionality using multiple random embeddings ⋮ Continuous models combining slacks-based measures of efficiency and super-efficiency ⋮ BSMPT v2 a tool for the electroweak phase transition and the baryon asymmetry of the universe in extended Higgs sectors ⋮ A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps ⋮ Lipschitz-inspired \texttt{HALRECT} algorithm for derivative-free global optimization ⋮ A new partition method for DIRECT-type algorithm based on minimax design ⋮ Optimization based on performance of lungs in body: lungs performance-based optimization (LPO) ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ Lipschitz gradients for global optimization in a one-point-based partitioning scheme ⋮ Objective and Violation Upper Bounds on a DIRECT-Filter Method for Global Optimization ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ Globalizer: a novel supercomputer software system for solving time-consuming global optimization problems ⋮ A partition-based global optimization algorithm ⋮ A modified DIviding RECTangles algorithm for a problem in astrophysics ⋮ Penalized multidimensional fitting for protein movement detection ⋮ Modeling, simulation, and optimization of geothermal energy production from hot sedimentary aquifers ⋮ A modified DIRECT algorithm with bilevel partition ⋮ Global optimization by multilevel partition ⋮ A direct search algorithm for global optimization ⋮ Continuous global optimization through the generation of parametric curves ⋮ RBFOpt: an open-source library for black-box optimization with costly function evaluations ⋮ Parameter estimation in ordinary differential equations modeling via particle swarm optimization ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ Design and implementation of a massively parallel version of DIRECT ⋮ Improving the convergence rate of the DIRECT global optimization algorithm ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants ⋮ Efficient multicriterial optimization based on intensive reuse of search information ⋮ An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity ⋮ Lipschitz and Hölder global optimization using space-filling curves ⋮ Global optimization of stochastic black-box systems via sequential kriging meta-models ⋮ The DIRECT algorithm: 25 years later ⋮ Filter-based DIRECT method for constrained global optimization ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ A multi-objective \textbf{DIRECT} algorithm for ship hull optimization ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Application of imperialist competitive algorithm to find minimax and standardized maximin optimal designs ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ A modified quasisecant method for global optimization ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ Global optimization of expensive black box functions using potential Lipschitz constants and response surfaces ⋮ A univariate global search working with a set of Lipschitz constants for the first derivative ⋮ Mechanistic spatio-temporal point process models for marked point processes, with a view to forest stand data ⋮ MrDIRECT: a multilevel robust DIRECT algorithm for global optimization problems ⋮ Multidimensional global extremum seeking via the DIRECT optimisation algorithm
Uses Software
This page was built for publication: A locally-biased form of the DIRECT algorithm.
