Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (Q2018512): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-014-0199-6 / 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/s10898-014-0199-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132337079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization requires global information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerations for global optimization covering methods using second derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic algorithm for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-Bound interval global optimization on shared memory multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete search in continuous global optimization and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond convex? global optimization is feasible only for convex objective functions: a theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical methods for finding global extrema (Case of a non-uniform mesh) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the nonuniform covering method to global optimization of mixed integer nonlinear problems / 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: Lipschitz gradients for global optimization in a one-point-based partitioning scheme / 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: A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global minimization algorithm for Lipschitz functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Branch-and-Branch Algorithms: Survey and Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3885544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shifted Power Method for Computing Tensor Eigenpairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate geometric Lipschitz global optimization algorithms / 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: 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: An algorithm for finding the absolute extremum of a function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues of a real supersymmetric tensor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global one-dimensional optimization using smooth auxiliary functions / 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: Global Optimization and Constraint Satisfaction / 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: Global optimization with non-convex constraints. Sequential and parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cubic spherical optimization problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-014-0199-6 / rank
 
Normal rank

Latest revision as of 07:12, 28 December 2024

scientific article
Language Label Description Also known as
English
Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
scientific article

    Statements

    Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2015
    0 references
    global optimization
    0 references
    Lipschitzian optimization
    0 references
    parallel branch and bound
    0 references
    nonconvex programming
    0 references
    0 references
    0 references
    0 references

    Identifiers