A integral filter algorithm for unconstrained global optimization
From MaRDI portal
Publication:879465
DOI10.1016/j.amc.2006.05.147zbMath1116.65075OpenAlexW2104600150MaRDI QIDQ879465
Mingming Li, Yong-jian Yang, Xue-Wu Du
Publication date: 14 May 2007
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.147
global optimizationunconstrained optimizationnumerical examplesbranch and boundlocal search algorithmintegral-form algorithm
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)
Related Items (1)
Cites Work
- A filled function method for finding a global minimizer of a function of several variables
- Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
- New classes of globally convexized filled functions for global optimization
- The globally convexized filled functions for global optimization
- Revised filled function methods for global optimization.
- Introduction to global optimization
- A regression method for the Monte Carlo evaluation of multidimensional integrals
- The Tunneling Algorithm for the Global Minimization of Functions
- The evaluation of multidimensional integrals
This page was built for publication: A integral filter algorithm for unconstrained global optimization