A parallel global optimization algorithm for rational separable- factorable functions

DOI10.1016/0096-3003(89)90047-7zbMath0677.65063OpenAlexW1981020312MaRDI QIDQ1123549

Renpu Ge

Publication date: 1989

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0096-3003(89)90047-7

zbMATH Keywords

global optimizationparallel computationrational separable-factorable function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A class of filled functions for finding global minimizers of a function of several variables
• Global optimization using interval analysis - the multi-dimensional case
• The globally convexized filled functions for global optimization
• A continuous approach to nonlinear integer programming

This page was built for publication: A parallel global optimization algorithm for rational separable- factorable functions