Pages that link to "Item:Q1361290"

The following pages link to The convergence speed of interval methods for global optimization (Q1361290):

Displaying 18 items.

• Improving the convergence rate of the DIRECT global optimization algorithm (Q522279) (← links)
• The extrapolated interval global optimization algorithm (Q540704) (← links)
• The theoretical and empirical rate of convergence for geometric branch-and-bound methods (Q609566) (← links)
• Theoretical rate of convergence for interval inclusion functions (Q695339) (← links)
• Empirical convergence speed of inclusion functions for facility location problems (Q861908) (← links)
• Theoretical convergence analysis of a general division-deletion algorithm for solving global search problems (Q868630) (← links)
• A fast memoryless interval-based algorithm for global optimization (Q975771) (← links)
• An interval version of Shubert's iterative method for the localization of the global maximum (Q1082042) (← links)
• Convergence rates of a global optimization algorithm (Q1186279) (← links)
• Accelerations for a variety of global optimization methods (Q1315439) (← links)
• A priority measure in interval methods for constrained global optimization (Q1321801) (← links)
• A surprising approach in interval global optimization (Q1597637) (← links)
• The impact of accelerating tools on the interval subdivision algorithm for global optimization (Q1804056) (← links)
• On the selection of subdivision directions in interval branch-and-bound methods for global optimization (Q1904648) (← links)
• Balanced random interval arithmetic in market model estimation (Q2433495) (← links)
• New interval methods for constrained global optimization (Q2490338) (← links)
• Empirical investigation of the convergence speed of inclusion functions in a global otimization context (Q2572918) (← links)
• Lipschitz continuity and the termination of interval methods for global optimization (Q5948880) (← links)