Pages that link to "Item:Q3734174"
From MaRDI portal
The following pages link to An algorithm for finding the global maximum of a multimodal, multivariate function (Q3734174):
Displayed 33 items.
- Multidimensional bisection: the performance and the context (Q686996) (← links)
- Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints (Q925234) (← links)
- On the convergence of global methods in multiextremal optimization (Q1078082) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- Multidimensional bisection applied to global optimisation (Q1174537) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- Convergence rates of a global optimization algorithm (Q1186279) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) (← links)
- Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) (← links)
- The bisection method in higher dimensions (Q1198735) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- Global optimization requires global information (Q1264973) (← links)
- Accelerations for a variety of global optimization methods (Q1315439) (← links)
- Accelerations for global optimization covering methods using second derivatives (Q1318273) (← links)
- Lipschitzian optimization without the Lipschitz constant (Q1321408) (← links)
- Multidimensional bisection: A dual viewpoint (Q1324321) (← links)
- A new filled function applied to global optimization. (Q1422382) (← links)
- Least squares splines with free knots: Global optimization approach. (Q1426188) (← links)
- A deterministic algorithm for global optimization (Q1803605) (← links)
- Cutting angle methods in global optimization (Q1808534) (← links)
- Several filled functions with mitigators. (Q1855890) (← links)
- New LP bound in multivariate Lipschitz optimization: Theory and applications (Q1905038) (← links)
- Towards pure adaptive search (Q1905968) (← links)
- Global optimization of Hölder functions (Q1918982) (← links)
- Customizing methods for global optimization -- a geometric viewpoint (Q2366969) (← links)
- Cutting angle method – a tool for constrained global optimization (Q3156719) (← links)
- Topics in Lipschitz global optimisation (Q4346952) (← links)
- Geometry and combinatorics of the cutting angle method (Q4467168) (← links)
- Lipschitz programming via increasing convex-along-rays functions<sup>*</sup> (Q4700278) (← links)
- On convergence of "divide the best" global optimization algorithms (Q4944418) (← links)
- Abstract convexity:examples and applications (Q4949174) (← links)
- Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms (Q5925738) (← links)