BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION

DOI10.3846/1392-6292.2008.13.145-159MaRDI QIDQ3511783zbMATH OpenOpenAlexFDO

Authors Julius Žilinskas

Publication date 11 July 2008

Published in Mathematical Modelling and Analysis (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3846/1392-6292.2008.13.145-159

zbMATH Keywords

branch and boundglobal optimizationsimplicial partitions

Mathematics Subject Classification ID

Decomposition methods (49M27) Nonlinear programming (90C30)

Recommendations

• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• On derivative based bounding for simplicial branch and bound
• A new simplicial cover technique in constrained global optimization
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• Simplicial global optimization

Cited in

(31)

• A new simplicial cover technique in constrained global optimization
• Subdivision, sampling, and initialization strategies for simplical branch and bound in global optimization.
• On parallel branch and bound frameworks for 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
• TRIOPT: A triangulation-based partitioning algorithm for global optimization
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic
• On a new smoothing technique for non-smooth, non-convex optimization
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints
• Global optimization of grillage-type foundations using a distributed genetic algorithm
• Simplicial Lipschitz optimization without the Lipschitz constant
• Globally-biased disimpl algorithm for expensive global optimization
• Integral simplex methods for the set partitioning problem: globalisation and anti-cycling
• A hybrid global optimization algorithm for nonlinear least squares regression
• A novel modeling and smoothing technique in global optimization
• On the exhaustivity of simplicial partitioning
• Simplicial global optimization
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique
• Parallel global optimization on GPU
• Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
• On the minimum number of simplex shapes in longest edge bisection refinement of a regular n-simplex
• Pareto-optimal front of cell formation problem in group technology
• On derivative based bounding for simplicial branch and bound
• Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant
• Mathematically Rigorous Global Optimization and Fuzzy Optimization
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints
• P-algorithm based on a simplicial statistical model of multimodal functions
• Adaptive global optimization based on a block-recursive dimensionality reduction scheme
• Bisecton by global optimization revisited
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds

This page was built for publication: BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3511783)