Pages that link to "Item:Q5664755"

The following pages link to A Sequential Method Seeking the Global Maximum of a Function (Q5664755):

Displayed 50 items.

• Solving nonlinear equation systems via global partition and search: Some experimental results (Q582008) ‎ (← links)
• Multidimensional bisection: the performance and the context (Q686996) ‎ (← links)
• Set partition by globally optimized cluster seed points (Q809887) ‎ (← links)
• Challenges of continuous global optimization in molecular structure prediction (Q877606) ‎ (← links)
• Concurrent stochastic methods for global optimization (Q908855) ‎ (← links)
• A filled function method for finding a global minimizer of a function of several variables (Q909584) ‎ (← links)
• Towards ``Ideal multistart''. A stochastic approach for locating the minima of a continuous function inside a bounded domain (Q1030234) ‎ (← links)
• Extended univariate algorithms for \(n\)-dimensional global optimization (Q1062427) ‎ (← links)
• A class of filled functions for finding global minimizers of a function of several variables (Q1077889) ‎ (← links)
• On the convergence of global methods in multiextremal optimization (Q1078082) ‎ (← links)
• An interval version of Shubert's iterative method for the localization of the global maximum (Q1082042) ‎ (← links)
• An algorithm for global optimization of Lipschitz continuous functions (Q1090241) ‎ (← 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)
• On computing the dispersion function (Q1094128) ‎ (← links)
• Efficient domain partitioning algorithms for global optimization of rational and Lipschitz continuous functions (Q1102868) ‎ (← links)
• An interval maximum entropy method for a discrete minimax problem (Q1126620) ‎ (← links)
• Multidimensional bisection applied to global optimisation (Q1174537) ‎ (← links)
• On Timonov's algorithm for global optimization of univariate Lipschitz functions (Q1177913) ‎ (← links)
• Convergence rates of a global optimization algorithm (Q1186279) ‎ (← links)
• Convergence qualification of adaptive partition algorithms in global optimization (Q1196187) ‎ (← links)
• Global optimization of univariate Lipschitz functions. I: Survey and properties (Q1198732) ‎ (← links)
• Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison (Q1198733) ‎ (← links)
• The bisection method in higher dimensions (Q1198735) ‎ (← links)
• An application of Lipschitzian global optimization to product design (Q1200528) ‎ (← links)
• Global optimization and polypeptide conformation (Q1216161) ‎ (← links)
• A global minimization algorithm for a class of one-dimensional functions (Q1244976) ‎ (← links)
• Global optimization using interval analysis: The one-dimensional case (Q1250687) ‎ (← links)
• Interval-majorant method and global optimization (Q1263252) ‎ (← 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)
• Cord-slope form of Taylor's expansion in univariate global optimization (Q1321477) ‎ (← links)
• A parallel method for finding the global minimum of univariate functions (Q1321483) ‎ (← links)
• Multidimensional bisection: A dual viewpoint (Q1324321) ‎ (← links)
• Application of Bayesian approach to numerical methods of global and stochastic optimization (Q1327427) ‎ (← links)
• Experiments with new stochastic global optimization search techniques (Q1571032) ‎ (← links)
• Comparison of partition evaluation measures in an adaptive partitioning algorithm for global optimization (Q1595195) ‎ (← links)
• A deterministic algorithm for global optimization (Q1803605) ‎ (← links)
• A hybrid global optimization method: The multi-dimensional case (Q1811602) ‎ (← links)
• An optimal algorithm for search of extrema of a bimodal function (Q1821513) ‎ (← links)
• A hybrid global optimization method: The one-dimensional case (Q1860412) ‎ (← links)
• Towards pure adaptive search (Q1905968) ‎ (← links)
• Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives (Q1962986) ‎ (← links)
• Optimum departure times for commuters in congested networks (Q2277160) ‎ (← links)
• Customizing methods for global optimization -- a geometric viewpoint (Q2366969) ‎ (← links)
• A new sampling method in the DIRECT algorithm (Q2369158) ‎ (← links)
• On the approximation of the global extremum of a semi-Lipschitz function (Q2390698) ‎ (← links)
• Interval method for global solutions of a class of min-max-min problems (Q2479123) ‎ (← links)
• Interpolation of Lipschitz functions (Q2499791) ‎ (← links)