Pages that link to "Item:Q5925738"

The following pages link to Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738):

Displaying 19 items.

• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• Lipschitz global optimization methods in control problems (Q386913) (← links)
• Numerical point of view on calculus for functions assuming finite, infinite, and infinitesimal values over finite, infinite, and infinitesimal domains (Q419992) (← links)
• Lipschitz gradients for global optimization in a one-point-based partitioning scheme (Q433950) (← links)
• Continued fractions as dynamical systems (Q440693) (← links)
• Diagonal generalizaton of the DIRECT method for problems with constraints (Q828532) (← links)
• Univariate global optimization with multiextremal non-differentiable constraints without penalty functions (Q853549) (← links)
• Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems (Q907199) (← links)
• A deterministic global optimization using smooth diagonal auxiliary functions (Q907200) (← links)
• Multidimensional Lipschitz global optimization based on efficient diagonal partitions (Q1029568) (← links)
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants (Q1754443) (← links)
• An algorithm of simplicial Lipschitz optimization with the bi-criteria selection of simplices for the bi-section (Q1754452) (← links)
• Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based algorithms (Q1777602) (← links)
• The DIRECT algorithm: 25 years later (Q2022319) (← links)
• Novel global optimization algorithm with a space-filling curve and integral function (Q2059171) (← links)
• On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619) (← links)
• Globally-biased disimpl algorithm for expensive global optimization (Q2250095) (← links)
• On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients (Q5270520) (← links)
• Numerical methods using two different approximations of space-filling curves for black-box global optimization (Q6200380) (← links)