Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives

DOI10.1016/S0898-1221(99)00067-XzbMath0931.90049OpenAlexW2031995499MaRDI QIDQ1962986

Yaroslav D. Sergeyev, Victor P. Gergel

Publication date: 20 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00067-x

zbMATH Keywords

convergenceparallel algorithmsunconstrained one-dimensional global optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Parallel numerical computation (65Y05)

Related Items (10)

Parallel global optimization on GPU ⋮ On the Least-Squares Fitting of Data by Sinusoids ⋮ A deterministic global optimization using smooth diagonal auxiliary functions ⋮ A new global optimization method for univariate constrained twice-differentiable NLP problems ⋮ A Simulink-based software solution using the infinity computer methodology for higher order differentiation ⋮ Properties and numerical testing of a parallel global optimization algorithm ⋮ Deterministic global optimization using space-filling curves and multiple estimates of Lipschitz and Hölder constants ⋮ Derivative-free local tuning and local improvement techniques embedded in the univariate global optimization ⋮ The scalability analysis of a parallel tree search algorithm ⋮ On Deterministic Diagonal Methods for Solving Global Optimization Problems with Lipschitz Gradients

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Sequential and parallel algorithms for global minimizing functions with Lipschitzian derivatives