BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
From MaRDI portal
Publication:3511783
DOI10.3846/1392-6292.2008.13.145-159zbMath1146.49029OpenAlexW2172102550MaRDI QIDQ3511783
Publication date: 11 July 2008
Published in: Mathematical Modelling and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3846/1392-6292.2008.13.145-159
Related Items (23)
Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ Parallel global optimization on GPU ⋮ Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints ⋮ A hybrid global optimization algorithm for nonlinear least squares regression ⋮ Global optimization of grillage-type foundations using a distributed genetic algorithm ⋮ On parallel branch and bound frameworks for global optimization ⋮ P-algorithm based on a simplicial statistical model of multimodal functions ⋮ A novel modeling and smoothing technique in global optimization ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ On the exhaustivity of simplicial partitioning ⋮ Pareto-optimal front of cell formation problem in group technology ⋮ Mathematically Rigorous Global Optimization and Fuzzy Optimization ⋮ 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 ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds ⋮ Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic ⋮ Depth-first simplicial partition for copositivity detection, with an application to MaxClique ⋮ On a new smoothing technique for non-smooth, non-convex optimization
This page was built for publication: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
