Pages that link to "Item:Q1198735"

The following pages link to The bisection method in higher dimensions (Q1198735):

Displaying 30 items.

• Random number generators in genetic algorithms for unconstrained and constrained optimization (Q419813) (← links)
• Multidimensional bisection: the performance and the context (Q686996) (← links)
• Bisecton by global optimization revisited (Q965055) (← links)
• On computing the dispersion function (Q1094128) (← links)
• Multidimensional bisection applied to global optimisation (Q1174537) (← links)
• Locating three-dimensional roots by a bisection method (Q1184614) (← links)
• Accelerations for a variety of global optimization methods (Q1315439) (← links)
• Multidimensional bisection: A dual viewpoint (Q1324321) (← links)
• A new trigonometrical algorithm for computing real root of non-linear transcendental equations (Q1738746) (← links)
• Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602) (← links)
• Cutting angle methods in global optimization (Q1808534) (← links)
• New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
• Towards pure adaptive search (Q1905968) (← links)
• Optimal bundle composition in competition for continuous attributes (Q2030370) (← links)
• Optimal capacity design under \(k\)-out-of-\(n\) and consecutive \(k\)-out-of-\(n\) type probabilistic constraints (Q2341243) (← links)
• Customizing methods for global optimization -- a geometric viewpoint (Q2366969) (← links)
• Complexity of the bisection method (Q2381525) (← links)
• A global convergent derivative-free method for solving a system of non-linear equations (Q2408152) (← links)
• A triple \((S, s, \ell)\)-thresholds base-stock policy subject to uncertainty environment, returns and order cancellations (Q2669482) (← links)
• (Q3533408) (← links)
• Extension of Bolzano search to rectangles which preserves rectangles as iterates (Q3796971) (← links)
• A bisection/successive approximation method for computing Gittins indices (Q3970270) (← links)
• Topics in Lipschitz global optimisation (Q4346952) (← links)
• Lipschitz programming via increasing convex-along-rays functions^* (Q4700278) (← links)
• Abstract convexity:examples and applications (Q4949174) (← links)
• (Q4984904) (← links)
• Bisections above Tight Lower Bounds (Q5200505) (← links)
• (Q5506446) (← links)
• Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)
• On the enumeration of subcells within hypercubes and its application to the Borsuk-Ulam theorem (Q6618221) (← links)