Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (Q5746707): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Slatec / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GlobSol / 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.2013.780058 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006261563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validated Linear Relaxations and Preprocessing: Some Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discussion and empirical comparisons of linear relaxations and alternate techniques in validated deterministic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: GlobSol user guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval computations, rigour and non-rigour in deterministic continuous global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum: Validated Linear Relaxations and Preprocessing: Some Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general framework for convexity analysis in deterministic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduced space branch and bound algorithm for global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A metaheuristic methodology based on the limitation of the memory of interval branch and bound algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reliable affine relaxation method for global optimization / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 07:52, 7 July 2024

scientific article; zbMATH DE number 6256399
Language Label Description Also known as
English
Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces
scientific article; zbMATH DE number 6256399

    Statements

    Assessment of a non-adaptive deterministic global optimization algorithm for problems with low-dimensional non-convex subspaces (English)
    0 references
    0 references
    0 references
    0 references
    7 February 2014
    0 references
    non-convex optimization
    0 references
    branch and bound algorithms
    0 references
    linear relaxations
    0 references
    0 references
    0 references
    0 references

    Identifiers