Finding global minima with a computable filled function.
From MaRDI portal
Publication:5929390
DOI10.1023/A:1008330632677zbMath1033.90088MaRDI QIDQ5929390
Publication date: 18 February 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
global optimizationfilled function methodglobal minima of multidimensional nonconvex functionsgradient methods
Related Items (42)
A new parameter free filled function for solving unconstrained global optimization problems ⋮ A filled function method for global optimization ⋮ A new filled function for global minimization and system of nonlinear equations ⋮ A filled function method for nonlinear equations ⋮ A novel filled function method and quasi-filled function method for global optimization ⋮ A parameter-free filled function for unconstrained global optimization ⋮ Unification of filled function and tunnelling function in global optimization ⋮ A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization ⋮ Non parameter-filled function for global optimization ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ Finding global minima with an inflection point-based filled function algorithm ⋮ A multi dynamics algorithm for global optimization ⋮ A novel one-parameter filled function method with an application to pathological analysis ⋮ Simple transformation functions for finding better minima ⋮ A new discrete filled function method for solving large scale max-cut problems ⋮ Parameter-free filled function method for nonlinear integer program ⋮ Subset simulation for unconstrained global optimization ⋮ A filled function method for constrained global optimization ⋮ A new filled function method with two parameters for global optimization ⋮ A discrete filled function algorithm for approximate global solutions of max-cut problems ⋮ A new filled function method applied to unconstrained global optimization ⋮ A new filled function method for unconstrained global optimization ⋮ A new filled function method for unconstrained global optimization ⋮ A new auxiliary function method for general constrained global optimization ⋮ Filled function method for nonlinear equations ⋮ Discrete filled function method for discrete global optimization ⋮ Global descent methods for unconstrained global optimization ⋮ A smoothing method of global optimization that preserves global minima ⋮ A new filled function method for constrained nonlinear equations ⋮ New modified function method for global optimization ⋮ Finding global minimizer with one-parameter filled function on unconstrained global optimization ⋮ A revised cut-peak function method for box constrained continuous global optimization ⋮ A class of augmented filled functions ⋮ A filled function method for global optimization with inequality constraints ⋮ A criterion for an approximation global optimal solution based on the filled functions ⋮ Dynamic globally concavized filled function method for continuous global optimization ⋮ A new filled function method for nonlinear equations ⋮ A filled function which has the same local minimizer of the objective function ⋮ Globally concavized filled function method for the box constrained continuous global minimization problem ⋮ An efficient dynamical evolutionary algorithm for global optimization ⋮ A class of filled functions for box constrained continuous global optimization
This page was built for publication: Finding global minima with a computable filled function.
