Finding global minima with a filled function approach for non-smooth global optimization (Q965773): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061871076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent developments and trends in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function method for unconstrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function for unconstrained global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function method for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mesh Adaptive Direct Search Algorithms for Constrained Optimization / rank
 
Normal rank

Latest revision as of 19:11, 2 July 2024

scientific article
Language Label Description Also known as
English
Finding global minima with a filled function approach for non-smooth global optimization
scientific article

    Statements

    Finding global minima with a filled function approach for non-smooth global optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 April 2010
    0 references
    Summary: A filled function approach is proposed for solving a non-smooth unconstrained global optimization problem. First, the definition of filled function in Zhang (2009) for smooth global optimization is extended to non-smooth case and a new one is put forwarded. Then, a novel filled function is proposed for non-smooth the global optimization and a corresponding non-smooth algorithm based on the filled function is designed. At last, a numerical test is made. The computational results demonstrate that the proposed approach is effcient and reliable.
    0 references
    0 references
    filled function
    0 references
    non-smooth unconstrained global optimization problem
    0 references
    non-smooth algorithm
    0 references
    0 references
    0 references