A new parameter free filled function for solving unconstrained global optimization problems

DOI10.1080/00207160.2020.1731484zbMath1479.90163OpenAlexW3006871138MaRDI QIDQ5031235

A. I. Ahmed

Publication date: 18 February 2022

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2020.1731484

zbMATH Keywords

local minimizationunconstrained global optimizationglobal minimizerfilled functionparameter free

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (5)

A new filled function for global minimization and system of nonlinear equations ⋮ A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization ⋮ Finding global minima with an inflection point-based filled function algorithm ⋮ A novel one-parameter filled function method with an application to pathological analysis ⋮ Parameter-free filled function method for nonlinear integer program

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• A deterministic annealing algorithm for approximating a solution of the min-bisection problem
• A continuously differentiable filled function method for global optimization
• A filled function method with one parameter for unconstrained global optimization
• A new filled function method with two parameters for global optimization
• A new class of filled functions with one parameter for global optimization
• A new filled function method applied to unconstrained global optimization
• A parameter free filled function for unconstrained global optimization
• A filled function method for finding a global minimizer of a function of several variables
• A new constructing auxiliary function method for global optimization
• Finding global minimizer with one-parameter filled function on unconstrained global optimization
• A filled function method with one parameter for box constrained global optimization
• Dynamic globally concavized filled function method for continuous global optimization
• A class of filled functions for finding global minimizers of a function of several variables
• Terminal repeller unconstrained subenergy tunneling (TRUST) for fast global optimization
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• A new filled function applied to global optimization.
• New classes of globally convexized filled functions for global optimization
• A modified tunneling function method for non-smooth global optimization and its application in artificial neural network
• A new discrete filled function method for finding global minimizer of the integer programming
• A filled function method for global optimization
• Finding discrete global minima with a filled function for integer programming
• Unsolvability of some optimization problems
• A new filled function for unconstrained global optimization
• A PIECEWISE POLYNOMIAL APPROXIMATION FOR SOLVING NONLINEAR OPTIMAL CONTROL PROBLEMS
• An algorithm for finding the global maximum of a multimodal, multivariate function
• A family of quasi-Newton methods for unconstrained optimization problems
• A new filled function method for global optimization
• A new filled function method for unconstrained 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
• Finding global minima with a computable filled function.

This page was built for publication: A new parameter free filled function for solving unconstrained global optimization problems