Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
DOI10.1007/S11590-009-0156-3zbMATH Open1189.90203OpenAlexW2061911928MaRDI QIDQ968007FDOQ968007
Julius Žilinskas, Remigijus Paulavičius, Andreas Grothey
Publication date: 3 May 2010
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/9144273/Investigation_of_selection_strategies_in_branch_and_bound_algorithm_with_simplicial_partitions_and_combination_of_Lipschitz_bounds.pdf
global optimizationbranch and boundLipschitz optimizationparallel branch and boundselection strategies
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Cites Work
- Generalized subinterval selection criteria for interval global optimization
- Introduction to global optimization
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- Branch and bound algorithm for multidimensional scaling with city-block metric
- Global optimization based on a statistical model and simplicial partitioning.
- Title not available (Why is that?)
- Probabilistic subproblem selection in branch-and-bound algorithms
- Theoretical justification of a heuristic subbox selection criterion for interval global optimization
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
- P-algorithm based on a simplicial statistical model of multimodal functions
- Solving combinatorial optimization problems in parallel: methods and techniques
- Parallel computing in optimization. Nordic Summer School, Linköping, Sweden, August 1995
- Title not available (Why is that?)
- Parallel scientific computing and optimization. Advances and applications
- Title not available (Why is that?)
Cited In (22)
- Globally-biased disimpl algorithm for expensive global optimization
- Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
- DIRECTGO: A new DIRECT-type MATLAB toolbox for derivative-free global optimization
- Adaptive global optimization based on a block-recursive dimensionality reduction scheme
- Branch and probability bound methods in multi-objective optimization
- Probabilistic subproblem selection in branch-and-bound algorithms
- Simplicial Lipschitz optimization without the Lipschitz constant
- Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization
- Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations
- P-algorithm based on a simplicial statistical model of multimodal functions
- A one-step worst-case optimal algorithm for bi-objective univariate optimization
- On a global optimization algorithm for bivariate smooth functions
- Pareto-optimal front of cell formation problem in group technology
- Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
- Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
- A new node selection strategy in the branch-and-bound procedure
- Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs
- On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization
- On parallel branch and bound frameworks for global optimization
- A hybrid global optimization algorithm for nonlinear least squares regression
- Solving a set of global optimization problems by the parallel technique with uniform convergence
- New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
Recommendations
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers 👍 👎
- Node selection strategies in interval branch and bound algorithms 👍 👎
- On the selection of subdivision directions in interval branch-and-bound methods for global optimization 👍 👎
- Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization. 👍 👎
- A new node selection strategy in the branch-and-bound procedure 👍 👎
This page was built for publication: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968007)
