Simplicial Global Optimization

DOI10.1007/978-1-4614-9093-7zbMath1401.90017OpenAlexW60763295MaRDI QIDQ2851341

Julius Žilinskas, Remigijus Paulavičius

Publication date: 10 October 2013

Published in: SpringerBriefs in Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-9093-7

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (64)

Computing an upper bound on contact stress with surrogate duality ⋮ A Search Algorithm for the Global Extremum of a Discontinuous Function ⋮ Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization ⋮ Decoupling linear and nonlinear regimes: an evaluation of efficiency for nonlinear multidimensional optimization ⋮ Generalized parallel computational schemes for time-consuming global optimization ⋮ A hybrid of Bayesian-based global search with Hooke–Jeeves local refinement for multi-objective optimization problems ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ Space-filling curves for numerical approximation and visualization of solutions to systems of nonlinear inequalities with applications in robotics ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ A new global optimization method for a symmetric Lipschitz continuous function and the application to searching for a globally optimal partition of a one-dimensional set ⋮ On parallel branch and bound frameworks for global optimization ⋮ Implementation of Cartesian grids to accelerate Delaunay-based derivative-free optimization ⋮ Granular sieving algorithm for selecting best n$$ n $$ parameters ⋮ Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes ⋮ Hyperparameter autotuning of programs with HybridTuner ⋮ Application of the \texttt{DIRECT} algorithm to searching for an optimal \(k\)-partition of the set \(\mathcal {A}\subset \mathbb {R}^n\) and its application to the multiple circle detection problem ⋮ (Global) optimization: historical notes and recent developments ⋮ Survey of Piecewise Convex Maximization and PCMP over Spherical Sets ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ Global optimization method with numerically calculated function derivatives ⋮ An accelerated algorithm for finding efficient solutions in multiobjective problems with black-box multiextremal criteria ⋮ Numerical methods using two different approximations of space-filling curves for black-box global optimization ⋮ An empirical study of various candidate selection and partitioning techniques in the \texttt{DIRECT} framework ⋮ Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ On strong homogeneity of a class of global optimization algorithms working with infinite and infinitesimal scales ⋮ A hybrid of Bayesian approach based global search with clustering aided local refinement ⋮ Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme ⋮ A Partition Based Bayesian Multi-objective Optimization Algorithm ⋮ Visualization of a statistical approximation of the Pareto front ⋮ Globally maximizing the sum of squares of quadratic forms over the unit sphere ⋮ Operational zones for comparing metaheuristic and deterministic one-dimensional global optimization algorithms ⋮ A direct search algorithm for global optimization ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ Application of reduced-set Pareto-Lipschitzian optimization to truss optimization ⋮ Rounding on the standard simplex: regular grids for global optimization ⋮ 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 ⋮ Approximating a solution set of nonlinear inequalities ⋮ On convergence rate of a rectangular partition based global optimization algorithm ⋮ GOSH: derivative-free global optimization using multi-dimensional space-filling curves ⋮ MSO: a framework for bound-constrained black-box global optimization algorithms ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ On the search of the shape parameter in radial basis functions using univariate global optimization methods ⋮ A \textsc{direct}-type global optimization algorithm for image registration ⋮ A combination of \texttt{RANSAC} and \texttt{DBSCAN} methods for solving the multiple geometrical object detection problem ⋮ The adaptation of the \(k\)-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ A combination of \(k\)-means and \texttt{DBSCAN} algorithm for solving the multiple generalized circle detection problem ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ On refinement of the unit simplex using regular simplices ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT} ⋮ On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic ⋮ Parallel global search algorithm with local tuning for solving mixed-integer global optimization problems ⋮ A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints ⋮ ON THE ACCURACY OF SOME ABSORBING BOUNDARY CONDITIONS FOR THE SCHRODINGER EQUATION ⋮ Multidimensional global optimization using numerical estimates of objective function derivatives ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients ⋮ Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints ⋮ An approach for simultaneous finding of multiple efficient decisions in multi-objective optimization problems

This page was built for publication: Simplicial Global Optimization