A filled function method for finding a global minimizer on global integer optimization

DOI10.1016/j.cam.2004.11.030zbMath1078.65054OpenAlexW2055452693MaRDI QIDQ557731

You-lin Shang, Lian-Sheng Zhang

Publication date: 30 June 2005

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2004.11.030

zbMATH Keywords

global optimizationinteger programmingnonlinear integer programmingnumerical experimentslocal minimizerglobal minimizerfilled function

Mathematics Subject Classification ID

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

Related Items (16)

Two-parameters quasi-filled function algorithm for nonlinear integer programming ⋮ A computational method for a class of non-standard time optimal control problems involving multiple time horizons ⋮ An auxiliary function method for global minimization in integer programming ⋮ A new discrete filled function method for solving large scale max-cut problems ⋮ New tunnel-filled function method for discrete global optimization ⋮ Parameter-free filled function method for nonlinear integer program ⋮ Identifying a global optimizer with filled function for nonlinear integer programming ⋮ A discrete filled function algorithm for approximate global solutions of max-cut problems ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ Modified Filled Function Method for Resolving Nonlinear Integer Programming Problem ⋮ 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 discrete filled function algorithm embedded with continuous approximation for solving max-cut problems ⋮ Towards global solutions of optimal discrete-valued control problems

Cites Work

• 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
• Recent developments and trends in global optimization
• New classes of globally convexized filled functions for global optimization
• The globally convexized filled functions for global optimization
• A continuous approach to nonlinear integer programming
• The Tunneling Algorithm for the Global Minimization of Functions
• A new filled function method for global optimization
• A class of generalized filled functions with improved computability
• SPT: A stochastic tunneling algorithm for global optimization

This page was built for publication: A filled function method for finding a global minimizer on global integer optimization