A one-step worst-case optimal algorithm for bi-objective univariate optimization (Q476260): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-013-0712-8 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C29 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6375168 / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-objective optimization
Property / zbMATH Keywords: multi-objective optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal algorithms
Property / zbMATH Keywords: optimal algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
global optimization
Property / zbMATH Keywords: global optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
Lipschitz optimization
Property / zbMATH Keywords: Lipschitz optimization / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Global Optimization Toolbox For Maple / 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.1007/s11590-013-0712-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1995978080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5502711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic approach to global box-constrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic global optimization. Geometric branch-and-bound methods and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization with non-convex constraints. Sequential and parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonuniform covering method as applied to multicriteria optimization problems with guaranteed accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Search Based on Efficient Diagonal Partitions and a Set of Lipschitz Constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the worst-case optimal multi-objective global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal strategies of the search for an extremum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best sequential search strategies for finding an extremum / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequentially optimal algorithm for numerical integration / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for finding the absolute extremum of a function / 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: Introduction to Global Optimization Exploiting Space-Filling Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration of Univariate Global Optimization Algorithms Working with Lipschitz Functions and Lipschitz First Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate geometric Lipschitz global optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lipschitz gradients for global optimization in a one-point-based partitioning scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical model-based algorithm for ‘black-box’ multi-objective optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing heuristics: We have it all wrong / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of test functions for global optimization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-013-0712-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:34, 9 December 2024

scientific article
Language Label Description Also known as
English
A one-step worst-case optimal algorithm for bi-objective univariate optimization
scientific article

    Statements

    A one-step worst-case optimal algorithm for bi-objective univariate optimization (English)
    0 references
    0 references
    28 November 2014
    0 references
    multi-objective optimization
    0 references
    optimal algorithms
    0 references
    global optimization
    0 references
    Lipschitz optimization
    0 references
    0 references
    0 references

    Identifiers