A parallel global optimization algorithm for rational separable- factorable functions

DOI10.1016/0096-3003(89)90047-7zbMATH Open0677.65063OpenAlexW1981020312MaRDI QIDQ1123549FDOQ1123549

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4068628
• A parallel method for finding the global minimum of univariate functions
• scientific article; zbMATH DE number 4100500
• A parallel computing scheme for minimizing a class of large scale functions
• A parallel algorithm for partially separable non-convex global minimization: Linear constraints

zbMATH Keywords

global optimizationparallel computationrational separable-factorable function

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Global optimization using interval analysis - the multi-dimensional case
• The globally convexized filled functions for global optimization
• A class of filled functions for finding global minimizers of a function of several variables
• Title not available (Why is that?)
• A continuous approach to nonlinear integer programming

Cited In (5)

• Parallel algorithms for global optimization problems
• When do evolutionary algorithms optimize separable functions in parallel?
• Global optimization of rational functions: a semidefinite programming approach
• Subdomain separability in global optimization
• A parallel computing scheme for minimizing a class of large scale functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123549)