Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
From MaRDI portal
Publication:1416301
DOI10.1016/S0898-1221(02)00205-5zbMath1047.90046MaRDI QIDQ1416301
Publication date: 14 December 2003
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Decomposition methods (49M27)
Related Items
DIRECT algorithm: A new definition of potentially optimal hyperrectangles, A deterministic global optimization using smooth diagonal auxiliary functions, Pareto optimality and robustness in bi-blending problems, Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints, The semi-continuous quadratic mixture design problem: description and branch-and-bound approach, On a global optimization algorithm for bivariate smooth functions, An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section, Pareto set approximation by the method of adjustable weights and successive lexicographic goal programming, Well-suited and adaptive post-processing for the visualization of \(hp\) simulation results, A fast memoryless interval-based algorithm for global optimization, On refinement of the unit simplex using regular simplices, Interval branch and bound with local sampling for constrained global optimization, On an Asymptotic Property of a Simplicial Statistical Model of Global Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multidimensional bisection: the performance and the context
- Multidimensional bisection applied to global optimisation
- Handbook of global optimization
- Introduction to global optimization
- Customizing methods for global optimization -- a geometric viewpoint
- Global optimization
