A new discrete filled function algorithm for discrete global optimization

DOI10.1016/j.cam.2006.02.032zbMath1115.65068OpenAlexW2119116495MaRDI QIDQ875372

Yumei Liang, Yong-jian Yang

Publication date: 13 April 2007

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.2006.02.032

zbMATH Keywords

algorithmglobal optimizationnumerical resultsnonlinear integer programmingfilled function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Related Items (11)

An augmented filled function for global nonlinear integer optimization ⋮ Optimal Control of Switched System with Time Delay Detection of Switching Signal ⋮ Filled function method to optimize supply chain transportation costs ⋮ A Class of Parameter-Free Filled Functions for Unconstrained Global Optimization ⋮ Discrete global optimization problems with a modified discrete filled function ⋮ An auxiliary function method for global minimization in integer programming ⋮ New tunnel-filled function method for discrete global optimization ⋮ Parameter-free filled function method for nonlinear integer program ⋮ A critical review of discrete filled function methods in solving nonlinear discrete optimization problems ⋮ 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

• A filled function method for finding a global minimizer of a function of several variables
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• The globally convexized filled functions for global optimization
• On Descent from Local Minima

This page was built for publication: A new discrete filled function algorithm for discrete global optimization