A note on ``A continuous approach to nonlinear integer programming

DOI10.1016/j.amc.2009.08.015zbMath1178.65067OpenAlexW1971620831MaRDI QIDQ1039712

Guoqing Zhang

Publication date: 23 November 2009

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

Full work available at URL: https://doi.org/10.1016/j.amc.2009.08.015

zbMATH Keywords

global optimizationnonlinear integer programmingfilled function methodpenalty function

Mathematics Subject Classification ID

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

Related Items (2)

DC programming approaches for discrete portfolio optimization under concave transaction costs ⋮ Random perturbation of the projected variable metric method for nonsmooth nonconvex optimization problems with linear constraints

Cites Work

• Discrete global descent method for discrete global optimization and nonlinear integer programming
• A discrete dynamic convexized method for nonlinear integer programming
• 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
• A continuous approach to nonlinear integer programming

This page was built for publication: A note on ``A continuous approach to nonlinear integer programming