Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds
From MaRDI portal
Publication:968007
DOI10.1007/s11590-009-0156-3zbMath1189.90203OpenAlexW2061911928MaRDI QIDQ968007
Remigijus Paulavičius, Andreas Grothey, Julius Žilinskas
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 optimizationLipschitz optimizationbranch and boundparallel branch and boundselection strategies
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
Adaptive global optimization based on a block-recursive dimensionality reduction scheme ⋮ Optimistic NAUTILUS navigator for multiobjective optimization with costly function evaluations ⋮ A hybrid global optimization algorithm for nonlinear least squares regression ⋮ On \texttt{MATLAB} experience in accelerating \texttt{DIRECT-GLce} algorithm for constrained global optimization through dynamic data structures and parallelization ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ On parallel branch and bound frameworks for global optimization ⋮ P-algorithm based on a simplicial statistical model of multimodal functions ⋮ Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant ⋮ Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs ⋮ 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 ⋮ Simplicial Lipschitz optimization without the Lipschitz constant ⋮ Globally-biased disimpl algorithm for expensive global optimization ⋮ Solving a set of global optimization problems by the parallel technique with uniform convergence ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints ⋮ Branch and probability bound methods in multi-objective optimization ⋮ Improved scheme for selection of potentially optimal hyper-rectangles in \texttt{DIRECT}
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic subproblem selection in branch-and-bound algorithms
- P-algorithm based on a simplicial statistical model of multimodal functions
- Parallel scientific computing and optimization. Advances and applications
- Branch and bound algorithm for multidimensional scaling with city-block metric
- Parallel computing in optimization. Nordic Summer School, Linköping, Sweden, August 1995
- Global optimization based on a statistical model and simplicial partitioning.
- Introduction to global optimization
- Solving combinatorial optimization problems in parallel: methods and techniques
- Generalized subinterval selection criteria for interval global optimization
- BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
- Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants
- Theoretical justification of a heuristic subbox selection criterion for interval global optimization
