Pseudorandom lattices for global optimization

DOI10.1016/S0898-1221(03)00135-4zbMath1055.90060OpenAlexW2089601619MaRDI QIDQ1827238

Efim A. Galperin, Anna Guinzbourg, Alexandre Guinzbourg

Publication date: 6 August 2004

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(03)00135-4

zbMATH Keywords

Global optimizationRandom latticesSmall sample uniformity

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Stochastic programming (90C15)

Related Items (1)

Small sample uniformity in random number generation

Cites Work

• Numerical experiments with one-dimensional adaptive cubic algorithm
• The alpha algorithm and the application of the cubic algorithm in case of unknown Lipschitz constant
• Global optimization in problems with uncertainties.
• A pseudo-random number generator for personal computers
• Minimization of functions having Lipschitz continuous first partial derivatives
• On the Convergence of Pattern Search Algorithms
• `` Direct Search Solution of Numerical and Statistical Problems
• Quasi-Random Methods for Estimating Integrals Using Relatively Small Samples
• Pattern Search Algorithms for Bound Constrained Minimization
• Deterministic Simulation of Random Processes
• A fast procedure for generating normal random variables
• Convergence Conditions for Ascent Methods
• A New Algorithm for Unconstrained Optimization
• Irregularities of distribution, VII
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudorandom lattices for global optimization