Frame based methods for unconstrained optimization (Q5925722): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Convergence of Pattern Search Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Multidirectional Search Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct Search Methods on Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Grid-Based Methods for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3155232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4421356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of Positive Linear Dependence / rank
 
Normal rank

Revision as of 14:09, 3 June 2024

scientific article; zbMATH DE number 1566508
Language Label Description Also known as
English
Frame based methods for unconstrained optimization
scientific article; zbMATH DE number 1566508

    Statements

    Frame based methods for unconstrained optimization (English)
    0 references
    0 references
    0 references
    19 February 2001
    0 references
    derivative free optimization
    0 references
    positive basis methods
    0 references
    convergence analysis
    0 references
    frame based methods
    0 references
    direct search methods
    0 references
    unconstrained optimization
    0 references
    This paper describes a wide class of direct search methods for unconstrained optimization, which make use of fragments of grids called frames. Convergence is shown under mild conditions which allow successive frames to be popd, pop popd, and scaled relative to one another.
    0 references

    Identifiers