A parallel computing scheme for minimizing a class of large scale functions

DOI10.1016/0096-3003(89)90055-6zbMath0679.65040OpenAlexW2095353962MaRDI QIDQ1822903

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)90055-6

zbMATH Keywords

algorithmconvergence rateglobal minimizationfunction with partially separable variableslarge scale functionsparallel computing scheme

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (1)

The globally convexized filled functions for global optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A filled function method for finding a global minimizer of a function of several variables
• A class of filled functions for finding global minimizers of a function of several variables
• Global optimization using interval analysis - the multi-dimensional case
• Partitioned variable metric updates for large structured optimization problems
• The globally convexized filled functions for global optimization
• A continuous approach to nonlinear integer programming
• A note about sparsity exploiting quasi-Newton updates
• On Sparse and Symmetric Matrix Updating Subject to a Linear Equation

This page was built for publication: A parallel computing scheme for minimizing a class of large scale functions