A cover partitioning method for bound constrained global optimization (Q2905347): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q60401436, #quickstatements; #temporary_batch_1708296850199
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: minpack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: alphaBB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1080/10556788.2011.557726 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1992958085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Augmented Lagrangian Methods with General Lower-Level Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Lagrangian methods under the constant positive linear dependence constraint qualification / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Accelerated Random Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of Generalized Pattern Searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization using an augmented Lagrangian method with variable lower-level constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Programming: Theory, Methods, and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization by continuous grasp / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitzian optimization without the Lipschitz constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing Unconstrained Optimization Software / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence qualification of adaptive partition algorithms in global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic global optimization methods part I: Clustering methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic global optimization methods part II: Multi level methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive partitioned random search to global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization / rank
 
Normal rank

Latest revision as of 14:09, 5 July 2024

scientific article
Language Label Description Also known as
English
A cover partitioning method for bound constrained global optimization
scientific article

    Statements

    A cover partitioning method for bound constrained global optimization (English)
    0 references
    27 August 2012
    0 references
    stochastic algorithm
    0 references
    global optimization
    0 references
    cover partitioning method
    0 references
    0 references
    0 references

    Identifiers