A filled function method for finding a global minimizer on global integer optimization (Q557731): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Lian-Sheng Zhang / rank
 
Normal rank
Property / review text
 
The authors present an algorithm for solving a nonlinear integer programming problem. This algorithm is based on a filled function introduced by the authors in this paper, obtained by modifying the global convexized filled function for continuous global optimization. Some numerical experiments and conclusions are given.
Property / review text: The authors present an algorithm for solving a nonlinear integer programming problem. This algorithm is based on a filled function introduced by the authors in this paper, obtained by modifying the global convexized filled function for continuous global optimization. Some numerical experiments and conclusions are given. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Dorel I. Duca / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65K05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C30 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 2183999 / rank
 
Normal rank
Property / zbMATH Keywords
 
integer programming
Property / zbMATH Keywords: integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
local minimizer
Property / zbMATH Keywords: local minimizer / rank
 
Normal rank
Property / zbMATH Keywords
 
global minimizer
Property / zbMATH Keywords: global minimizer / rank
 
Normal rank
Property / zbMATH Keywords
 
filled function
Property / zbMATH Keywords: filled function / rank
 
Normal rank
Property / zbMATH Keywords
 
global optimization
Property / zbMATH Keywords: global optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
nonlinear integer programming
Property / zbMATH Keywords: nonlinear integer programming / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical experiments
Property / zbMATH Keywords: numerical experiments / rank
 
Normal rank

Revision as of 15:08, 1 July 2023

scientific article
Language Label Description Also known as
English
A filled function method for finding a global minimizer on global integer optimization
scientific article

    Statements

    A filled function method for finding a global minimizer on global integer optimization (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2005
    0 references
    The authors present an algorithm for solving a nonlinear integer programming problem. This algorithm is based on a filled function introduced by the authors in this paper, obtained by modifying the global convexized filled function for continuous global optimization. Some numerical experiments and conclusions are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    local minimizer
    0 references
    global minimizer
    0 references
    filled function
    0 references
    global optimization
    0 references
    nonlinear integer programming
    0 references
    numerical experiments
    0 references