A non-parameter filled function method for unconstrained global optimization problems
From MaRDI portal
Publication:6635990
DOI10.1142/s0217595923500136MaRDI QIDQ6635990
Suxia Ma, Yuelin Gao, Yingchun Liu, Eryang Guo
Publication date: 12 November 2024
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Optimization by Simulated Annealing
- A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization
- A continuously differentiable filled function method for global optimization
- A new filled function method with two parameters for global optimization
- A new filled function method applied to unconstrained global optimization
- A filled function method for global optimization with inequality constraints
- A parameter free filled function for unconstrained global optimization
- A new discrete filled function algorithm for discrete global optimization
- A filled function method for finding a global minimizer of a function of several variables
- New filled functions for nonsmooth global optimization
- A class of filled functions for finding global minimizers of a function of several variables
- A new filled function for unconstrained global optimization
- Non parameter-filled function for global optimization
- The Tunneling Algorithm for the Global Minimization of Functions
- Complexity analysis for optimization methods
- A new filled function method for global optimization
- A new filled function method for unconstrained global optimization
- A new filled function method for global optimization
- A new filled function method for unconstrained global optimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
This page was built for publication: A non-parameter filled function method for unconstrained global optimization problems
