Computational comparison of two methods for constrained global optimization (Q1342896): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Separable concave minimization via partial outer approximation and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian stopping rules for multistart global optimization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for solving linearly constrained separable concave global minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel stochastic method for solving linearly constrained concave global minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic global optimization methods part I: Clustering methods / rank
 
Normal rank

Latest revision as of 11:28, 23 May 2024

scientific article
Language Label Description Also known as
English
Computational comparison of two methods for constrained global optimization
scientific article

    Statements

    Computational comparison of two methods for constrained global optimization (English)
    0 references
    0 references
    0 references
    0 references
    9 February 1995
    0 references
    0 references
    constrained concave global minimization
    0 references
    stochastic multistart approach
    0 references
    global minimum solution
    0 references
    test problems
    0 references
    separable concave objectives
    0 references
    computational comparison
    0 references