Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
From MaRDI portal
Publication:2018512
Recommendations
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Some problems of solving Lipschitzian global optimization problems using the branch and bound method
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
- IMPROVED LIPSCHITZ BOUNDS WITH THE FIRST NORM FOR FUNCTION VALUES OVER MULTIDIMENSIONAL SIMPLEX
Cites work
- scientific article; zbMATH DE number 3691091 (Why is no real title available?)
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 914364 (Why is no real title available?)
- A Sequential Method Seeking the Global Maximum of a Function
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- A deterministic algorithm for global optimization
- A deterministic approach to global box-constrained optimization
- A global minimization algorithm for Lipschitz functions
- A univariate global search working with a set of Lipschitz constants for the first derivative
- Acceleration of univariate global optimization algorithms working with Lipschitz functions and Lipschitz first derivatives
- Accelerations for global optimization covering methods using second derivatives
- An algorithm for finding the absolute extremum of a function
- An application of the nonuniform covering method to the global optimization of mixed integer nonlinear problems
- Benchmarking global optimization and constraint satisfaction codes
- Benchmarking optimization software with performance profiles.
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem
- Branch-and-Bound interval global optimization on shared memory multiprocessors
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- Complete search in continuous global optimization and constraint satisfaction
- Eigenvalues of a real supersymmetric tensor
- Global one-dimensional optimization using smooth auxiliary functions
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Global optimization requires global information
- Global optimization with non-convex constraints. Sequential and parallel algorithms
- Introduction to global optimization
- Introduction to global optimization exploiting space-filling curves
- Lipschitz gradients for global optimization in a one-point-based partitioning scheme
- Numerical methods for finding global extrema (Case of a non-uniform mesh)
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Shifted power method for computing tensor eigenpairs
- The cubic spherical optimization problems
- Univariate geometric Lipschitz global optimization algorithms
Cited in
(8)- Some problems of solving Lipschitzian global optimization problems using the branch and bound method
- (Global) optimization: historical notes and recent developments
- Parameter tuning for a cooperative parallel implementation of process-network synthesis algorithms
- Some inequalities on the spectral radius of nonnegative tensors
- Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
- scientific article; zbMATH DE number 903760 (Why is no real title available?)
- A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
- Parallel Branch and Bound Algorithm with Combination of Lipschitz Bounds over Multidimensional Simplices for Multicore Computers
This page was built for publication: Branching and bounding improvements for global optimization algorithms with Lipschitz continuity properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018512)
