On the convergence of adaptive partition algorithms in global optimization (Q3496164): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A probabilistic algorithm for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally convergent methods for <i>n</i>-dimensional multiextremal optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended univariate algorithms for \(n\)-dimensional global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization on convex sets / 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: Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set partition by globally optimized cluster seed points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Method Seeking the Global Maximum of a Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two algorithms for one-dimensional multimodai minimization / rank
 
Normal rank

Latest revision as of 11:00, 21 June 2024

scientific article
Language Label Description Also known as
English
On the convergence of adaptive partition algorithms in global optimization
scientific article

    Statements

    Identifiers