Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives
From MaRDI portal
Publication:1962986
DOI10.1016/S0898-1221(99)00067-XzbMath0931.90049MaRDI QIDQ1962986
Yaroslav D. Sergeyev, Victor P. Gergel
Publication date: 20 January 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C30: Nonlinear programming
65Y05: Parallel numerical computation
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Concurrent stochastic methods for global optimization
- Extended univariate algorithms for \(n\)-dimensional global optimization
- Nonlinear observation via global optimization: measure theory approach
- Random tunneling by means of acceptance-rejection sampling for global optimization
- Global multidimensional optimization on parallel computer
- Global optimization of univariate Lipschitz functions. II: New algorithms and computational comparison
- Accelerations for a variety of global optimization methods
- A parallel method for finding the global minimum of univariate functions
- Handbook of global optimization
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- A deterministic algorithm for global optimization
- Bayesian stopping rules for multistart global optimization methods
- A global minimization algorithm with parallel iterations
- A parallel global optimization method and its implementation on a transputer system
- An algorithm for finding the absolute extremum of a function
- A parallel algorithm for global optimization
- A Sequential Method Seeking the Global Maximum of a Function
- Global optimization
