Pages that link to "Item:Q3511783"

The following pages link to BRANCH AND BOUND WITH SIMPLICIAL PARTITIONS FOR GLOBAL OPTIMIZATION (Q3511783):

Displaying 23 items.

• Parallel global optimization on GPU (Q330491) (← links)
• Pareto-optimal front of cell formation problem in group technology (Q486727) (← links)
• P-algorithm based on a simplicial statistical model of multimodal functions (Q621736) (← links)
• Adaptive global optimization based on a block-recursive dimensionality reduction scheme (Q828539) (← links)
• Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds (Q968007) (← links)
• On parallel branch and bound frameworks for global optimization (Q1683320) (← links)
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
• Solving a set of global optimization problems by the parallel technique with uniform convergence (Q1754445) (← links)
• A simplicial homology algorithm for Lipschitz optimisation (Q1756767) (← links)
• On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic (Q2046307) (← links)
• On a new smoothing technique for non-smooth, non-convex optimization (Q2061308) (← links)
• Global optimization method with dual Lipschitz constant estimates for problems with non-convex constraints (Q2156486) (← links)
• Global optimization of grillage-type foundations using a distributed genetic algorithm (Q2173520) (← links)
• Simplicial Lipschitz optimization without the Lipschitz constant (Q2249819) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• A hybrid global optimization algorithm for nonlinear least squares regression (Q2392764) (← links)
• A novel modeling and smoothing technique in global optimization (Q2423275) (← links)
• On the exhaustivity of simplicial partitioning (Q2442641) (← links)
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique (Q3093056) (← links)
• Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers (Q3613504) (← links)
• Acceleration of Global Search by Implementing Dual Estimates for Lipschitz Constant (Q5122335) (← links)
• Mathematically Rigorous Global Optimization and Fuzzy Optimization (Q5153504) (← links)
• Advantages of simplicial partitioning for Lipschitz optimization problems with linear constraints (Q5963229) (← links)