On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (Q2199619): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cnsns.2015.11.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2119260517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5502711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average-case analysis of numerical problems / 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: 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: A one-step worst-case optimal algorithm for bi-objective univariate optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993195 / 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 optimization with non-convex constraints. Sequential and parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic global optimization. / 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: A univariate global search working with a set of Lipschitz constants for the first derivative / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient strategy for adaptive partition of N-dimensional intervals in the framework of diagonal algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5317017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient partition of \(N\)-dimensional intervals in the framework of one-point-based 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: A deterministic global optimization using smooth diagonal auxiliary functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems / rank
 
Normal rank

Latest revision as of 15:00, 23 July 2024

scientific article
Language Label Description Also known as
English
On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
scientific article

    Statements

    On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization (English)
    0 references
    0 references
    0 references
    11 September 2020
    0 references
    0 references
    bi-objective optimization
    0 references
    optimal algorithms
    0 references
    Lipschitz optimization
    0 references
    trisection
    0 references
    0 references
    0 references
    0 references
    0 references