Discrete Filled Function Method for Discrete Global Optimization

Authors:
Chi-Kong Ng;Lian-Sheng Zhang;Duan Li;Wei-Wen Tian
Affiliations:
Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., People's Republic of China;Department of Mathematics, Shanghai University, Shanghai, People's Republic of China 200436;Department of Systems Engineering and Engineering Management, The Chinese University of Hong Kong, Shatin, N.T., People's Republic of China;Department of Mathematics, Shanghai University, Shanghai, People's Republic of China 200436
Venue:
Computational Optimization and Applications
Year:
2005

Citing 16
Cited 6

More test examples for nonlinear programming codes

More test examples for nonlinear programming codes
A class of filled functions for finding global minimizers of several variables

Journal of Optimization Theory and Applications
A new branching rule for the branch and bound algorithm for solving non-linear integer programming problems

BIT
A continuous approach to nonlinear integer programming

Applied Mathematics and Computation
A filled function method for finding a global minimizer of a function of several variables

Mathematical Programming: Series A and B
An approximate algorithm for nonlinear integer programming

Applied Mathematics and Computation
Testing Unconstrained Optimization Software

ACM Transactions on Mathematical Software (TOMS)
Asymptotic Strong Duality for Bounded Integer Programming: A Logarithmic-Exponential Dual Formulation

Mathematics of Operations Research
Revised filled function methods for global optimization

Applied Mathematics and Computation
Test Examples for Nonlinear Programming Codes

Test Examples for Nonlinear Programming Codes
Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints

SIAM Journal on Optimization
Finding Global Minima with a Computable Filled Function

Journal of Global Optimization
Success Guarantee of Dual Search in Integer Programming: p-th Power Lagrangian Method

Journal of Global Optimization
Filled functions for unconstrained global optimization

Journal of Global Optimization
A Controlled Random Search Technique Incorporating the Simulated Annealing Concept for Solving Integer and Mixed Integer Global Optimization Problems

Computational Optimization and Applications
A New Filled Function Method for Global Optimization

Journal of Global Optimization

Discrete global descent method for discrete global optimization and nonlinear integer programming

Journal of Global Optimization
A discrete filled function algorithm for approximate global solutions of max-cut problems

Journal of Computational and Applied Mathematics
A discrete dynamic convexized method for nonlinear integer programming

Journal of Computational and Applied Mathematics
Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming

Computers and Operations Research
New convolutive-error-measure and minimum total-model-order determination algorithm for equalization in communications

GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A new discrete filled function method for solving large scale max-cut problems

Numerical Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

A discrete filled function method is developed in this paper to solve discrete global optimization problems over "strictly pathwise connected domains." Theoretical properties of the proposed discrete filled function are investigated and a solution algorithm is proposed. Numerical experiments reported in this paper on several test problems with up to 200 variables have demonstrated the applicability and efficiency of the proposed method.